Crypto-machine learning enabled blockchain based profile pricer

ABSTRACT

A crypto-machine learning enabled blockchain based profile pricer processes computer-readable instructions to determine requested information for a user that can be displayed on a user interface in real-time or near real-time of the user&#39;s request. In addition, the crypto-machine learning enabled blockchain based profile pricer processes provided data to be customized for the user based on a user profile stored in the memory as well as based on third party data stored in a database of related information. The pricer communicates the data to the user using blockchains via a smart contract using a private key and initiates a data transfer based on an input received from the user.

TECHNICAL FIELD

Aspects of the disclosure relate to cryptography, and more specifically,to a cryptography based communications system that providestechnological advancements over existing systems by providing securecommunications with enhanced speed and transparency.

BACKGROUND

Companies involved in international transactions, including financialbusinesses, manufacturing companies, and service-related businesses,often engage in the exchange of foreign currency. Foreign currencyexchanges may include a financial institution operating as a buyer,seller, or an intermediary, e.g., between a buyer and a seller, for theexchange of a particular currency. The exchange of foreign currency, or“forex” trading, is often performed by financial institutions, such asbanks. These exchanges may include a difference between a real price anda quoted price, or a spread. Difficulties often arise in providing thisspread and other relevant information to interested parties in a mannerthat is secure, timely, and transparent. Methods such as phone calls ande-mails to deliver trade and pricing information have disadvantages inthat they lack sufficient security, timeliness, and transparency.Additional difficulties arise in determining a spread that is likely toresult in an accepted offer, in an environment with many offers fromcompeting entities, leading to system-wide inefficiencies and missedopportunities for parties on both sides of a potential transaction suchas a forex trade.

SUMMARY

The following presents a simplified summary of various aspects describedherein. This summary is not an extensive overview, and is not intendedto identify required or critical elements or to delineate the scope ofthe claims. The following summary merely presents some concepts in asimplified form as an introductory prelude to the more detaileddescription provided below.

To overcome limitations in the prior art described above, and toovercome other limitations that will be apparent upon reading andunderstanding the present specification, aspects described herein aredirected towards crypto-machine learning enabled blockchain basedprofile pricer. A first aspect includes receiving third party data of aplurality of exchanges of foreign currency, such as by one or moreservers. Another aspect includes determining a user profile, based onthe third party data, to provide a customized quote to the user for anexchange of foreign currency that is competitive with quotes or tradesfor transactions of the same currency types. This determining can beperformed by one or more processors in a cryptography machine learningenabled blockchain based apparatus. In another aspect, the quote can betransmitted to a blockchain node for transparent, secure, and timelyaccess by a user using a private key. The disclosed crypto-machinelearning enabled blockchain based profile pricer overcomes limitationsof the prior art by providing transparent, secure, and real-time or nearreal-time quotes for an exchange of foreign currency that is customizedto a user and accounts for transactions with third parties involving thesame types of currency. Aspects described herein provide transparency toa customer about a trade and pricing information, such as a spread for aforex trade, which can lead to increased trust and retention ofcustomers. Aspects described herein also provide mechanisms forproviding increased competitiveness of quotes for greater customervalue. Further, aspects include enhanced security for communicatingsensitive financial information in a reliable and efficient manner.These and additional aspects will be appreciated with the benefit of thedisclosures discussed in further detail below.

Various aspects described herein may be embodied as a system, method, anapparatus, or as one or more computer-readable media storingcomputer-executable instructions. Accordingly, those aspects may takethe form of an entirely hardware embodiment, an entirely softwareembodiment, or an embodiment combining software and hardware aspects.Any and/or all of the method steps described herein may be implementedas computer-readable instructions stored on a computer-readable medium,such as a non-transitory computer-readable medium. In addition, varioussignals representing data or events as described herein may betransferred between a source and a destination in the form of lightand/or electromagnetic waves traveling through signal-conducting mediasuch as metal wires, optical fibers, and/or wireless transmission media(e.g., air and/or space).

Aspects of the disclosure have been described in terms of illustrativeembodiments thereof. Numerous other embodiments, modifications, andvariations within the scope and spirit of the disclosure will occur topersons of ordinary skill in the art from a review of this disclosure.For example, one of ordinary skill in the art will appreciate that thesteps illustrated herein may be performed in other than the recitedorder, and that one or more steps illustrated may be optional inaccordance with aspects of the disclosure.

BRIEF DESCRIPTION OF THE DRAWINGS

A more complete understanding of aspects described herein and theadvantages thereof may be acquired by referring to the followingdescription in consideration of the accompanying drawings, in which likereference numbers indicate like features, and wherein:

FIG. 1 depicts an illustrative example of centralized computer system inaccordance with one or more illustrative aspects described herein.

FIG. 2 depicts an illustrative example of decentralized P2P computersystem that may be used in accordance with one or more illustrativeaspects described herein.

FIG. 3A depicts an illustrative example of a full node computing devicethat may be used in accordance with one or more illustrative aspectsdescribed herein.

FIG. 3B depicts an illustrative example of a lightweight node computingdevice that may be used in accordance with one or more illustrativeaspects described herein.

FIG. 4 depicts an illustrative example of a suitable computing systemenvironment that may be used in accordance with one or more illustrativeaspects described herein.

FIG. 5 depicts an illustrative example of a system in accordance withone or more illustrative aspects described herein.

FIG. 6 depicts an illustrative example of C in accordance with one ormore illustrative aspects described herein.

FIG. 7A depicts an illustrative example of a user interface that may beused in accordance with one or more illustrative aspects describedherein.

FIG. 7B depicts an illustrative example of a user interface that may beused in accordance with one or more illustrative aspects describedherein.

FIG. 8 depicts an illustrative example of a high-level system diagramfor a blockchain based system in accordance with one or moreillustrative aspects described herein.

FIG. 9 depicts an illustrative example of a process for providing aquote to a user in accordance with one or more illustrative aspectsdescribed herein.

FIG. 10 depicts an illustrative example of a system for blockchain nodesand distributed ledgers in accordance with one or more illustrativeaspects described herein.

FIG. 11 depicts an illustrative example of a process for adjusting apricing agreement in accordance with one or more illustrative aspectsdescribed herein.

FIG. 12 depicts an illustrative example of a high-level system diagramfor an automated pricing system in accordance with one or moreillustrative aspects described herein.

FIG. 13 depicts an illustrative example of a process for determining aspread in accordance with one or more illustrative aspects describedherein.

DETAILED DESCRIPTION

In the following description of the various embodiments, reference ismade to the accompanying drawings identified above and which form a parthereof, and in which is shown by way of illustration various embodimentsin which aspects described herein may be practiced. It is to beunderstood that other embodiments may be utilized and structural andfunctional modifications may be made without departing from the scopedescribed herein. Various aspects are capable of other embodiments andof being practiced or being carried out in various different ways.

As a general introduction to the subject matter described in more detailbelow, aspects described herein are directed towards foreign currencyexchange, and more particularly, to analyzing quotes and/or trades forthird-party foreign currency exchanges, as well as analyzing dataspecific to one or more users, to determine a customized quote that hasan increased likelihood of acceptance. Aspects described herein also aredirected to communicating quotes, spreads, agreements, and otherinformation related to a financial transactions in a secure,transparent, and prompt manner using blockchain technology.

It is to be understood that the phraseology and terminology used hereinare for the purpose of description and should not be regarded aslimiting. Rather, the phrases and terms used herein are to be giventheir broadest interpretation and meaning. The use of “including” and“comprising” and variations thereof is meant to encompass the itemslisted thereafter and equivalents thereof as well as additional itemsand equivalents thereof. The use of the terms “mounted,” “connected,”“coupled,” “positioned,” “engaged” and similar terms, is meant toinclude both direct and indirect mounting, connecting, coupling,positioning and engaging.

The disclosure provided herein is described, at least in part, inrelation to a decentralized peer-to-peer (e.g., P2P) system specializedfor the purpose of managing a blockchain. The decentralized P2P systemmay be comprised of computing devices that are distributed in multiplelocations across a geographical area as opposed to a single locationsuch as a business or company. The computing devices forming thedecentralized P2P system may operate with each other to manage ablockchain, which may be a data structure used to store informationrelated to the decentralized P2P system. More specifically, theblockchain may be a chronological linkage of data elements (e.g.,blocks) which store data records relating to the decentralized computingsystem.

A user may access the decentralized P2P system through a specialized“wallet” that serves to uniquely identify the user and enable the userto perform functions related to the decentralized P2P network. Throughthe wallet, the user may be able to hold tokens, funds, or any otherasset associated with the decentralized P2P system. Furthermore, theuser may be able to use the wallet to request performance ofnetwork-specific functions related to the decentralized P2P system suchas fund, token, and/or asset transfers. The various computing devicesforming the decentralized P2P computing system may operate as a team toperform network-specific functions requested by the user. In performingthe network-specific functions, the various computing devices mayproduce blocks that store the data generated during the performance ofthe network-specific functions and may add the blocks to the blockchain.After the block has been added to the blockchain, the wallet associatedwith the user may indicate that the requested network-specific functionhas been performed.

For example, a user may have a wallet which reflects that the user hasfive tokens associated with the decentralized P2P system. The user mayprovide a request to the decentralized P2P system to transfer the fivetokens to a friend who also has a wallet. The various computing devicesforming the decentralized P2P computing system may perform the requestand transfer the five tokens from the wallet of the user to the walletof the friend. In doing so, a block may be created by the variouscomputing devices of the decentralized P2P computing system. The blockmay store data indicating that the five tokens were transferred from thewallet of the user to the wallet of the friend. The various computingdevices may add the block to the blockchain. At such a point, the walletof the user may reflect the transfer of the five tokens to the wallet ofthe friend, and may indicate a balance of zero. The wallet of thefriend, however, may also reflect the transfer of the five tokens andmay have a balance of five tokens.

In more detail, the decentralized P2P system may be specialized for thepurpose of managing a distributed ledger, such as a private blockchainor a public blockchain, through the implementation of digitalcryptographic hash functions, consensus algorithms, digital signatureinformation, and network-specific protocols and commands. Thedecentralized P2P system (e.g., decentralized system) may be comprisedof decentralized system infrastructure consisting of a pluralitycomputing devices, either of a heterogeneous or homogenous type, whichserve as network nodes (e.g., full nodes and/or lightweight nodes) tocreate and sustain a decentralized P2P network (e.g., decentralizednetwork). Each of the full network nodes may have a complete replica orcopy of a blockchain stored in memory and may operate in concert, basedon the digital cryptographic hash functions, consensus algorithms,digital signature information, and network-specific protocols, toexecute network functions and/or maintain inter-nodal agreement as tothe state of the blockchain. Each of the lightweight network nodes mayhave at least a partial replica or copy of the blockchain stored inmemory and may request performance of network functions through theusage of digital signature information, hash functions, and networkcommands. In executing network functions of the decentralized network,such as balance sheet transactions and smart contract operations, atleast a portion of the full nodes forming the decentralized network mayexecute the one or more cryptographic hash functions, consensusalgorithms, and network-specific protocols to register a requestednetwork function on the blockchain. In some instances, a plurality ofnetwork function requests may be broadcasted across at least a portionof the full nodes of the decentralized network, aggregated throughexecution of the one or more digital cryptographic hash functions, andvalidated by performance of the one or more consensus algorithms togenerate a single work unit (e.g., block), which may be added in atime-based, chronological manner to the blockchain through performanceof network-specific protocols.

While in practice the term “blockchain” may hold a variety ofcontextually derived meanings, the term blockchain, as used herein,refers to a concatenation of sequentially dependent data elements (e.g.,blocks) acting as a data ledger that stores records relating to adecentralized computing system. Such data records may be related tothose used by a particular entity or enterprise, such as a financialinstitution, and/or may be associated with a particular applicationand/or use case including, but not limited to, cryptocurrency, digitalcontent storage and delivery, entity authentication and authorization,digital identity, marketplace creation and operation, internet of things(e.g., IoT), prediction platforms, election voting, medical records,currency exchange and remittance, P2P transfers, ride sharing, gaming,trading platforms, and real estate, precious metal, and work of artregistration and transference, among others. A “private blockchain” mayrefer to a blockchain of a decentralized private system in which onlyauthorized computing devices are permitted to act as nodes in adecentralized private network and have access to the private blockchain.In some instances, the private blockchain may be viewable and/oraccessible by authorized computing devices which are not participatingas nodes within the decentralized private network, but still have propercredentials. A “public blockchain” may refer to a blockchain of adecentralized public system in which any computing devices may bepermitted to act as nodes in a decentralized public network and haveaccess to the public blockchain. In some instances, the publicblockchain may be viewable and/or accessible by computing devices whichare not participating as nodes within the decentralized public network.

Further, a “full node” or “full node computing device,” as used herein,may describe a computing device in a decentralized system which operatesto create and maintain a decentralized network, execute requestednetwork functions, and maintain inter-nodal agreement as to the state ofthe blockchain. In order to perform such responsibilities, a computingdevice operating as a full node in the decentralized system may have acomplete replica or copy of the blockchain stored in memory, as well asexecutable instructions for the execution of hash functions, consensusalgorithms, digital signature information, network protocols, andnetwork commands. A “lightweight node,” “light node,” “lightweight nodecomputing device,” or “light node computing device” may refer to acomputing device in a decentralized system, which operates to requestperformance of network functions (e.g., balance sheet transactions,smart contract operations, and the like) within a decentralized networkbut without the capacity to execute requested network functions andmaintain inter-nodal agreement as to the state of the blockchain. Assuch, a computing device operating as a lightweight node in thedecentralized system may have a partial replica or copy of theblockchain. In some instances, network functions requested bylightweight nodes to be performed by the decentralized network may alsobe able to be requested by full nodes in the decentralized system.

“Network functions” and/or “network-specific functions,” as describedherein, may relate to functions which are able to be performed by nodesof a decentralized P2P network. In some arrangements, the data generatedin performing network-specific functions may or may not be stored on ablockchain associated with the decentralized P2P network. Examples ofnetwork functions may include “smart contract operations” and “balancesheet transaction.” A smart contract operation, as used herein, maydescribe one or more operations performed by a “smart contract,” whichmay be one or more algorithms and/or programs associated with one ormore nodes within a decentralized P2P network. A balance sheettransaction may describe one or more changes to data holdings associatedwith one or more nodes within a decentralized network.

In one or more aspects of the disclosure, a “digital cryptographic hashfunction,” as used herein, may refer to any function which takes aninput string of characters (e.g., message), either of a fixed length ornon-fixed length, and returns an output string of characters (e.g.,hash, hash value, message digest, digital fingerprint, digest, and/orchecksum) of a fixed length. Examples of digital cryptographic hashfunctions may include BLAKE (e.g., BLAKE-256, BLAKE-512, and the like),MD (e.g., MD2, MD4, MD5, and the like), Scrypt, SHA (e.g., SHA-1,SHA-256, SHA-512, and the like), Skein, Spectral Hash, SWIFT, Tiger, andso on. A “consensus algorithm,” as used herein and as described infurther detail below, may refer to one or more algorithms for achievingagreement on one or more data values among nodes in a decentralizednetwork. Examples of consensus algorithms may include proof of work(e.g., PoW), proof of stake (e.g., PoS), delegated proof of stake (e.g.,DPoS), practical byzantine fault tolerance algorithm (e.g., PBFT), andso on. Furthermore, “digital signature information” may refer to one ormore private/public key pairs and digital signature algorithms which areused to digitally sign a message and/or network function request for thepurposes of identity and/or authenticity verification. Examples ofdigital signature algorithms which use private/public key pairscontemplated herein may include public key infrastructure (PKI),Rivest-Shamir-Adleman signature schemes (e.g., RSA), digital signaturealgorithm (e.g., DSA), Edwards-curve digital signature algorithm, andthe like. A “wallet,” as used herein, may refer to one or more dataand/or software elements (e.g., digital cryptographic hash functions,digital signature information, and network-specific commands) that allowa node in a decentralized P2P network to interact with the decentralizedP2P network.

As will be described in further detail below, a decentralized P2P systemimplementing a blockchain data structure may provide solutions totechnological problems existing in current centralized system constructswith traditional data storage arrangements. For example, conventionaldata storage arrangements that use a central data authority have asingle point of failure (namely, the central storage location) which, ifcompromised by a malicious attacker, can lead to data tampering,unauthorized data disclosure, and exploitation and/or loss of operativecontrol of the processes performed by the centralized system. Theimplementation of a blockchain data structure in a decentralized P2Psystem acts as a safeguard against unreliable and/or malicious nodesacting in the decentralized P2P network to undermine the work efforts ofthe other nodes, e.g., by providing byzantine fault tolerance within thenetwork.

Computing Architectures

FIG. 1 depicts an illustrative example of centralized computer system100 in accordance with one or more illustrative aspects describedherein. Centralized computer system 100 may comprise one or morecomputing devices including at least server infrastructure 110 and usercomputing devices 120. Each of user computing devices 120 may beconfigured to communicate with server infrastructure 110 through network130. In some arrangements, centralized computer system 100 may includeadditional computing devices and networks that are not depicted in FIG.1, which also may be configured to interact with server infrastructure110 and, in some instances, user computing devices 120.

Server infrastructure 110 may be associated with a distinct entity suchas a company, school, government, and the like, and may comprise one ormore personal computer(s), server computer(s), hand-held or laptopdevice(s), multiprocessor system(s), microprocessor-based system(s), settop box(es), programmable consumer electronic device(s), networkpersonal computer(s) (PC), minicomputer(s), mainframe computer(s),distributed computing environment(s), and the like. Serverinfrastructure 110 may include computing hardware and software that mayhost various data and applications for performing tasks of thecentralized entity and interacting with user computing devices 120, aswell as other computing devices. For example, each of the computingdevices comprising server infrastructure 110 may include at least one ormore processors 112 and one or more databases 114, which may be storedin memory of the one or more computing devices of server infrastructure110. Through execution of computer-readable instructions stored inmemory, the computing devices of server infrastructure 110 may beconfigured to perform functions of the centralized entity and store thedata generated during the performance of such functions in databases114.

In some arrangements, server infrastructure 110 may include and/or bepart of enterprise information technology infrastructure and may host aplurality of enterprise applications, enterprise databases, and/or otherenterprise resources. Such applications may be executed on one or morecomputing devices included in server infrastructure 110 usingdistributed computing technology and/or the like. In some instances,server infrastructure 110 may include a relatively large number ofservers that may support operations of a particular enterprise ororganization, such as a financial institution. Server infrastructure110, in this embodiment, may generate a single centralized ledger fordata received from the various user computing devices 120, which may bestored in databases 114.

Each of the user computing devices 120 may be configured to interactwith server infrastructure 110 through network 130. In some instances,one or more of the user computing devices 120 may be configured toreceive and transmit information corresponding to system requeststhrough particular channels and/or representations of webpages and/orapplications associated with server infrastructure 110. The systemrequests provided by user computing devices 120 may initiate theperformance of particular computational functions such as data and/orfile transfers at server infrastructure 110. In such instances, the oneor more of the user computing devices may be internal computing devicesassociated with the particular entity corresponding to serverinfrastructure 110 and/or may be external computing devices which arenot associated with the particular entity.

As stated above, centralized computer system 100 also may include one ormore networks, which may interconnect one or more of serverinfrastructure 110 and one or more user computing devices 120. Forexample, centralized computer system 100 may include network 130.Network 130 may include one or more sub-networks (e.g., local areanetworks (LANs), wide area networks (WANs), or the like). Furthermore,centralized computer system 100 may include a local network configuredto each of the computing devices comprising server infrastructure 110.The local network connecting auto identification and mapping computingplatform 120, system infrastructure 130, and/or post-performance reviewcomputing device 140 may interface with network 150 and enablecommunication with user computing devices 110A-110N.

Furthermore, in some embodiments, centralized computer system 100 mayinclude a plurality of computer systems arranged in an operativenetworked communication with one another through a network, which mayinterface with server infrastructure 110, user computing devices 120,and network 130. The network may be a system specific distributivenetwork receiving and distributing specific network feeds andidentifying specific network associated triggers. The network may alsobe a global area network (GAN), such as the Internet, a wide areanetwork (WAN), a local area network (LAN), or any other type of networkor combination of networks. The network may provide for wireline,wireless, or a combination wireline and wireless communication betweendevices on the network.

In the centralized computer system 100 described in regard to FIG. 1,server infrastructure 110 may serve as a central authority which managesat least a portion of the computing data and actions performed inrelation to the particular entity associated with server infrastructure110. As such, server infrastructure 110 of centralized computer system100 provides a single point of failure which, if compromised by amalicious attacker, can lead to data tampering, unauthorized datadisclosure, and exploitation and/or loss of operative control of theprocesses performed by the server infrastructure 110 in relation to theparticular entity associated with server infrastructure 110. In such acentralized construct in which a single point of failure (e.g., serverinfrastructure 110) is created, significant technological problems ariseregarding maintenance of operation and data control, as well aspreservation of data integrity. As will be described in further detailbelow in regard to FIG. 2, such technological problems existing incentralized computing arrangements may be solved by a decentralized P2Psystem implementing a blockchain data structure, even wholly within theserver infrastructure 110.

FIG. 2 depicts an illustrative example of decentralized P2P computersystem 200 that may be used in accordance with one or more illustrativeaspects described herein. Decentralized P2P computer system 200 mayinclude a plurality of full node computing devices 210A, 210B, 210C,210D, 210E, and 210F and lightweight node computing devices 250A and250B, which may be respectively similar to full node computing device210 described in regard to FIG. 3A and lightweight node computing device250 described in regard to FIG. 3B. While a particular number of fullnode computing devices and lightweight node computing devices aredepicted in FIG. 2, it should be understood that a number of full nodecomputing devices and/or lightweight node computing devices greater orless than that of the depicted full node computing devices andlightweight node computing devices may be included in decentralized P2Pcomputer system 200. Accordingly, any additional full node computingdevices and/or lightweight node computing devices may respectivelyperform in the manner described below in regard to full node computingdevices 210A-210F and lightweight node computing devices 250A and 250Bin decentralized P2P computer system 200.

Each of full node computing devices 210A-210F may operate in concert tocreate and maintain decentralized P2P network 270 of decentralized P2Pcomputer system 200. In creating decentralized P2P network 270 ofdecentralized P2P computer system 200, processors, ASIC devices, and/orgraphics processing units (e.g., GPUs) of each full node computingdevice 210A-210F may execute network protocols which may cause each fullnode computing device 210A-210F to form a communicative arrangement withthe other full node computing devices 210A-210F in decentralized P2Pcomputer system 200 and create decentralized P2P network 270.Furthermore, the execution of network protocols by the processors, ASICdevices, and/or graphics processing units (e.g., GPUs) of full nodecomputing devices 210A-210F may cause full node computing devices210A-210F to execute network functions related to blockchain 226 andthereby maintain decentralized P2P network 270.

Lightweight node computing devices 250A and 250B may request executionof network functions related to blockchain 226 in decentralized P2Pnetwork 270. In order to request execution of network functions, such asbalance sheet transaction and/or smart contract operations, processorsof lightweight node computing devices 250A and 250B may execute networkcommands to broadcast the network functions to decentralized P2P network270 comprising full node computing devices 210A-210F.

For example, lightweight node computing device 250A may requestexecution of a balance sheet transaction related to blockchain 226 indecentralized P2P network 270, which may entail a data transfer from aprivate/public key associated with lightweight node computing device250A to a private/public key associated with lightweight node 250B. Indoing so, processors of lightweight node computing device 250A mayexecute network commands to broadcast balance sheet transaction networkfunction request 280 to decentralized P2P network 270. Balance sheettransaction network function request 280 may include details about thedata transfer such as data type and amount, as well as a data transferamount to full node computing devices 210A-201F of decentralized P2Pnetwork 270 for executing balance sheet transaction network functionrequest 280. Balance sheet transaction network function request 280 mayfurther include the public key associated with lightweight nodecomputing device 250B. Processors of lightweight node computing device250A may execute digital signature algorithms to digitally sign balancesheet transaction network function request 280 with the private keyassociated with lightweight node computing device 250A.

At decentralized P2P network 270, balance sheet transaction networkfunction request 280 may be broadcasted to each of full node computingdevices 210A-210F through execution of network protocols by full nodecomputing devices 210A-210F. In order to execute balance sheettransaction network function request 280 and maintain inter-nodalagreement as to the state of blockchain 226, processors, ASIC devices,and/or GPUs of full node computing devices 210A-210F may execute networkprotocols to receive broadcast of the network function through adecentralized P2P network 270 and from lightweight node computing device250A. Processors, ASIC devices, and/or GPUs of full node computingdevices 210A-210F may execute hash functions to generate a digest ofbalance sheet transaction network function request 280. The resultantdigest of balance sheet transaction network function request 280, inturn, may be hashed with the block hash of the most immediatelypreceding block of blockchain 226. Processors, ASIC devices, and/or GPUsof full node computing devices 210A-210F may execute consensusalgorithms to identify a numerical value (e.g., nonce) corresponding tothe particular executed consensus algorithm and related to the digestthat combines the digest of the balance sheet transaction networkfunction request 280 and the block hash of the most immediatelypreceding block of blockchain 226.

For example, in embodiments in which the consensus algorithm is proof ofwork (e.g., PoW), processors, ASIC devices, and/or GPUs of full nodecomputing devices 210A-210F may perform a plurality of hashingoperations to identify a nonce that, when hashed with the digest thatcombines the digest of the balance sheet transaction network functionrequest 280 and the block hash of the most immediately preceding blockof blockchain 226, produces a hash of a predetermined alphanumericalformat. Such a predetermined alphanumerical format may include apredetermined number of consecutive alphanumerical characters at apredetermined position within the resultant digest that combines thenonce, digest of the balance sheet transaction network function request280, and block hash of the most immediately preceding block ofblockchain 226.

In embodiments in which the consensus algorithm is proof of stake (e.g.,PoS), a private key associated with one of full node computing devices210A-210F may be pseudo-randomly selected, based on balance sheetholdings associated with the public keys of full node computing devices210A-210F, to serve as the nonce. For example, through execution of thePoS consensus algorithm, full node computing devices 210A-210F areentered into a lottery in which the odds of winning are proportional toa balance sheet amount associated the public key of each of full nodecomputing devices 210A-210F, wherein a larger balance sheet amountcorresponds to a higher probability to win the lottery. The PoSconsensus algorithm may cause a full node computing device from fullnode computing devices 210A-210F to be selected, and the public key ofthe selected full node computing device to be used as the nonce.

In embodiments in which the consensus algorithm is delegated proof ofstake (e.g., DPoS), a group of delegates are chosen from full nodecomputing devices 210A-210F by each of computing devices 210A-210F,wherein full node computing devices 210A-210F are allowed to vote ondelegates based on balance sheet holdings associated with the respectivepublic keys. Full node computing devices 210A-210F, however, may notvote for themselves to be delegates. Once the group of delegates arechosen, the group of delegates from full node computing devices210A-210F select a public key associated with one of full node computingdevices 210A-210F to serve as the nonce. Again, each of the delegatesare prohibited from selecting themselves and their respective public keyfrom serving as the nonce.

In embodiments in which the consensus algorithm is practical byzantinefault tolerance algorithm (e.g., PBFT), each of full node computingdevices 210A-210F are associated with a particular status and/or ongoingspecific information associated with the respective public key of thefull node computing devices. Each of full node computing devices210A-210F receive a message through decentralized P2P network 270 basedon network protocols. Based on the received message and particularstatus and/or ongoing specific information, each of full node computingdevices 210A-210F perform computational tasks and transmit a response tothe tasks to each of the other full node computing devices 210A-210F. Apublic key associated with a particular full node computing device fromfull node computing devices 210A-210F is selected by each of full nodecomputing devices 210A-210F based on the response of the particular fullnode computing device best fulfilling criteria determined based on thenetwork protocols.

The identification of the nonce enables processors, ASIC devices, and/orGPUs of the full node computing device from full node computing devices210A-210F to create a new block with a block header (e.g., block hash),which is a digest that combines the digest of balance sheet transactionnetwork function request 280, the block hash of the most immediatelypreceding block, and the identified nonce. Processors, ASIC devices,and/or GPUs of the full node computing device from full node computingdevices 210A-210F may execute network protocols to add the new block toblockchain 226 and broadcast the new block to the other full nodecomputing devices in the decentralized P2P network 270. In somearrangements, the new block may also be time-stamped at a timecorresponding to the addition to blockchain 226. Furthermore, as areward for adding the new block to blockchain 226, the full nodecomputing device from full node computing devices 210A-210F may beallowed, per the network protocols, to increase a balance sheet holdingsamount associated with itself by a predetermined amount. In somearrangements, each of full node computing devices 210A-210F may receivean equal portion of the data transfer amount specified by lightweightnode computing device 260A for executing balance sheet transactionnetwork function request 280. After the new block has been added toblockchain 226, balance sheet transaction network function request 280may be considered to be executed and the data transfer from theprivate/public key associated with lightweight node computing device250A to the private/public key associated with lightweight node 250B maybe registered.

As stated above, in some arrangements, a plurality of network functionrequests may be broadcasted across decentralized network P2P network270. Processors, ASIC devices, and/or GPUs of full node computingdevices 210A-210F may execute network protocols to receive broadcast ofeach of the network functions, including balance sheet transactionnetwork function request 280, through decentralized P2P network 270 andfrom the requesting entities, including lightweight node computingdevice 250A. Processors, ASIC devices, and/or GPUs of full nodecomputing devices 210A-210F may execute hash functions to generate ahash tree (e.g., Merkle tree) of the requested network functions, whichculminates in a single digest (e.g., root digest, root hash, and thelike) that comprises the digests of each of the requested networkfunctions, including balance sheet transaction network function request280. The root digest of the requested network function, in turn, may behashed with the block hash of the most immediately preceding block ofblockchain 226. Processors, ASIC devices, and/or GPUs of full nodecomputing devices 210A-210B may execute consensus algorithms in themanner described above to identify a nonce corresponding to theparticular executed consensus algorithm and related to the digest thatcombines the root digest of the requested network functions and theblock hash of the most immediately preceding block of blockchain 226.The identification of the nonce enables processors, ASIC devices, and/orGPUs of the full node computing device from full node computing devices210A-210F to create a new block with a block header (e.g., block hash),which is a digest that combines the root digest of the network functionrequests, the block hash of the most immediately preceding block, andthe identified nonce. Processors, ASIC devices, and/or GPUs of the fullnode computing device from full node computing devices 210A-210F mayexecute network protocols to add the new block to blockchain 226 andbroadcast the new block to the other full node computing devices in thedecentralized P2P network 270. In some arrangements, the new block mayalso be time-stamped at a time corresponding to the addition toblockchain 226. Furthermore, as a reward for adding the new block toblockchain 226, the full node computing device from full node computingdevices 210A-210F may be allowed, per the network protocols, to increasea balance sheet holdings amount associated with itself by apredetermined amount. In some arrangements, each of full node computingdevices 210A-210F may receive an equal portion of the data transferamount specified by each of the network function requests. After the newblock has been added to blockchain 226, each of the network functionsrequests, including balance sheet transaction network function request280, may be considered to be executed and the data transfer from theprivate/public key associated with lightweight node computing device250A to the private/public key associated with lightweight node 250B maybe registered.

While the description provided above is made in relation to a balancesheet transaction involving lightweight node computing device 250A andlightweight node computing device 250B, it is to be understood thatbalance sheet transactions are not limited to lightweight node computingdevice 250A and lightweight node computing device 250B, but rather maybe made across any of the full node computing devices and/or lightweightnode computing devices in decentralized P2P system 200.

For another example, lightweight node computing device 250B may requesta smart contract operation related to blockchain 226 in decentralizedP2P network 270, which may facilitate a dual data transfer between aprivate/public key associated with lightweight node computing device250B and a private/public key associated lightweight node computingdevice 250A. Processors of lightweight node computing device 250B mayexecute network commands to broadcast smart contract operation networkfunction request 290 to decentralized P2P network 270. Smart contractoperation network function request 290 may include details about thedata transfer such as data type and amount, as well as a data transferamount to full node computing devices 210A-210F of decentralized P2Pnetwork 270 for executing smart contract operation network functionrequest 290. Smart contract operation network function request 290 mayfurther include the public key associated with the smart contract.Processors of lightweight node computing device 250B may execute digitalsignature algorithms to digitally sign smart contract operation networkfunction request 290 with the private key associated with lightweightnode computing device 250B.

At decentralized P2P network 270, smart contract operation networkfunction request 290 may be broadcasted to each of full node computingdevices 210A-210F through execution of network protocols by full nodecomputing devices 210A-210F. In order to execute smart contractoperation network function request 290 and maintain inter-nodalagreement as to the state of blockchain 226, processors, ASIC devices,and/or GPUs of full node computing devices 210A-210F may execute networkprotocols to receive broadcast of the network function through adecentralized P2P network 270 and from lightweight node computing device250B. Processors, ASIC devices, and/or GPUs of full node computingdevices 210A-210F may execute hash functions to generate a digest ofsmart contract operation network function request 290. The resultantdigest of smart contract operation network function request 290, inturn, may be hashed with the block hash of the most immediatelypreceding block of blockchain 226. Processors, ASIC devices, and/or GPUsof full node computing devices 210A-210F may execute consensusalgorithms to identify a nonce corresponding to the particular executedconsensus algorithm and related to the digest that combines the digestof smart contract operation network function request 290 and the blockhash of the most immediately preceding block of blockchain 226.

The identification of the nonce enables processors, ASIC devices, and/orGPUs of the full node computing device from full node computing devices210A-210F to create a new block with a block header (e.g., block hash),which is a digest that combines smart contract operation networkfunction request 290, the block hash of the most immediately precedingblock, and the identified nonce. Processors, ASIC devices, and/or GPUsof the full node computing device from full node computing devices210A-210F may execute network protocols to add the new block toblockchain 226 and broadcast the new block to the other full nodecomputing devices in the decentralized P2P network 270. In somearrangements, the new block may also be time-stamped at a timecorresponding to the addition to blockchain 226. Furthermore, as areward for adding the new block to blockchain 226, the full nodecomputing device from full node computing devices 210A-210F may, per thenetwork protocols, increase a balance sheet holdings amount associatedwith itself by a predetermined amount. In some arrangements, each offull node computing devices 210A-210F may receive an equal portion ofthe data transfer amount specified by lightweight node computing device260A for executing smart contract operation network function request290. After the new block has been added to blockchain 226, smartcontract operation request 290 may be considered to be executed and thedata transfer from the private/public key associated with lightweightnode computing device 250B to the private/public key associated with thesmart contract may be registered.

The smart contract may be configured to hold the data transfer from theprivate/public key associated with lightweight node computing device250B until fulfillment of certain predetermined criteria hardcoded intothe smart contract is achieved. The smart contract may be configuredsuch that it serves as an intermediate arbiter between entities withinthe decentralized P2P network 270 and may specify details of a dual datatransfer between entities.

Lightweight node computing device 250A may also request a smart contractoperation related to blockchain 226 in decentralized P2P network 270,which may conclude the dual data transfer between a private/public keyassociated lightweight node computing device 250A and a private/publickey associated with lightweight node computing device 250B. Processorsof lightweight node computing device 250A may execute network commandsto broadcast the smart contract operation network function request todecentralized P2P network 270. The smart contract operation networkfunction request may include details about the data transfer such asdata type and amount, as well as a data transfer amount to full nodecomputing devices 210A-210F of decentralized P2P network 270 forexecuting the smart contract operation network function request. Thesmart contract operation network function request may further includethe public key associated with the smart contract. Processors oflightweight node computing device 250A may execute digital signaturealgorithms to digitally sign the smart contract operation networkfunction request with the private key associated with lightweight nodecomputing device 250A.

At decentralized P2P network 270, the smart contract operation networkfunction request may be broadcasted to each of full node computingdevices 210A-210F through execution of network protocols by full nodecomputing devices 210A-210F. In order to execute the smart contractoperation network function request and maintain inter-nodal agreement asto the state of blockchain 226, processors, ASIC devices, and/or GPUs offull node computing devices 210A-210F may execute network protocols toreceive broadcast of the network function through a decentralized P2Pnetwork 270 and from lightweight node computing device 250A. Processors,ASIC devices, and/or GPUs of full node computing devices 210A-210F mayexecute hash functions to generate a digest of the smart contractoperation network function request. The resultant digest of the smartcontract operation network function request, in turn, may be hashed withthe block hash of the most immediately preceding block of blockchain226. Processors, ASIC devices, and/or GPUs of full node computingdevices 210A-210F may execute consensus algorithms to identify a noncecorresponding to the particular executed consensus algorithm and relatedto the digest that combines the digest of the smart contract operationnetwork function request and the block hash of the most immediatelypreceding block of blockchain 226.

The identification of the nonce enables processors, ASIC devices, and/orGPUs of the full node computing device from full node computing devices210A-210F to create a new block with a block header (e.g., block hash),which is a digest that combines the smart contract operation networkfunction request, the block hash of the most immediately precedingblock, and the identified nonce. Processors, ASIC devices, and/or GPUsof the full node computing device from full node computing devices210A-210F may execute network protocols to add the new block toblockchain 226 and broadcast the new block to the other full nodecomputing devices in the decentralized P2P network 270. In somearrangements, the new block may also be time-stamped at a timecorresponding to the addition to blockchain 226. Furthermore, as areward for adding the new block to blockchain 226, the full nodecomputing device from full node computing devices 210A-210F may beallowed, per the network protocols, to increase a balance sheet holdingsamount associated with itself by a predetermined amount. In somearrangements, each of full node computing devices 210A-210F may receivean equal portion of the data transfer amount specified by lightweightnode computing device 260A for executing the smart contract operationnetwork function request. After the new block has been added toblockchain 226, the smart contract operation transaction networkfunction request 290 may be considered to be executed and the datatransfer from the private/public key associated with lightweight nodecomputing device 250A to the private/public key associated with thesmart contract may be registered.

When the smart contract receives the data value from each of lightweightnode computing device 250A and lightweight node computing device 250B,the smart contract may transfer the data value from lightweight nodecomputing device 250A to lightweight node computing device 250B and thedata value from lightweight node computing device 250B to lightweightnode computing device 250A.

While the description provided above was made in relation to lightweightnode computing device 250A and lightweight node computing device 250B,it should be understood that any of the full node computing devices andlightweight node computing devices in decentralized system 200 mayparticipate in the smart contract. Furthermore, it should be understoodthat the smart contract may be able to fulfill dual data transfers inthe manner described above across a plurality of entities entering intothe smart contract. For example, a first plurality of entities may enterinto the smart contract, which may hold the data values for each of thefirst plurality of entities until a second plurality of entities enterinto the smart contract. When each of the first plurality of entitiesand the second plurality of entities have entered, the smart contractmay perform the data transfer.

In comparison to the centralized computing system 100 described inregard to FIG. 1, decentralized P2P computer system 200 may providetechnological advantages. For example, by distributing storage ofblockchain 226 across multiple full node computing devices 210A-210F,decentralized P2P computer system 200 may not provide a single point offailure for malicious attack. In the event that any of the full nodecomputing devices 210A-210F are compromised by a malicious attacker,decentralized P2P computer system 200 may continue to operate unabatedas data storage of blockchain 226 and network processes are notcontrolled by a singular entity such as server infrastructure 110 ofcentralized computing system 100.

Furthermore, by utilizing blockchain data structure 226, decentralizedP2P system 200 may provide technological improvements to conventionaldecentralized P2P systems in regard to byzantine fault tolerancestemming from an unreliable and/or malicious full node acting indecentralized P2P network 270 to undermine the work efforts of the othernodes. For example, in coordinating action between full node computingdevices 210A-210F in relation to a similar computational task (e.g.,consensus algorithm), a malicious node would need to have computationalpower greater than the combined computational power of each of the otherfull node computing devices in decentralized P2P network 270 to identifythe nonce and thereby be able to modify blockchain 226. As such, thelikelihood that a malicious node could subvert decentralized P2P network270 and enter falsified data into blockchain 270 is inverselyproportional to the total computational power of decentralized P2Psystem 200. Therefore, the greater the total computational power ofdecentralized P2P system 200, the less likely that a malicious nodecould subvert decentralized P2P network 270 and undermine blockchain226.

FIG. 3A depicts an illustrative example of a full node computing device210 that may be used in accordance with one or more illustrative aspectsdescribed herein. Full node computing device 210 may be any of apersonal computer, server computer, hand-held or laptop device,multiprocessor system, microprocessor-based system, set top box,programmable consumer electronic device, network personal computer,minicomputer, mainframe computer, distributed computing environment,virtual computing device, and the like and may operate in adecentralized P2P network. In some embodiments, full node computingdevice 210 may be configured to operate in a decentralized P2P networkand may request execution of network functions and/or to executerequested network functions and maintain inter-nodal agreement as to thestate of a blockchain of the decentralized P2P network.

Full node computing device 210 may include one or more processors 211,which control overall operation, at least in part, of full nodecomputing device 210. Full node computing device 210 may further includerandom access memory (RAM) 213, read only memory (ROM) 214, networkinterface 212, input/output interfaces 215 (e.g., keyboard, mouse,display, printer, and the like), and memory 220. Input/output (I/O) 215may include a variety of interface units and drives for reading,writing, displaying, and/or printing data or files. In somearrangements, full node computing device 210 may further comprisespecialized hardware components such as application-specific integratedcircuit (e.g., ASIC) devices 216 and/or graphics processing units (e.g.,GPUs) 217. Such specialized hardware components may be used by full nodecomputing device 210 in performing one or more of the processes involvedin the execution of requested network functions and maintenance ofinter-nodal agreement as to the state of a blockchain. Full nodecomputing device 210 may further store in memory 220 operating systemsoftware for controlling overall operation of the full node computingdevice 210, control logic for instructing full node computing device 210to perform aspects described herein, and other application softwareproviding secondary, support, and/or other functionality which may ormight not be used in conjunction with aspects described herein.

Memory 220 may also store data and/or computer executable instructionsused in performance of one or more aspects described herein. Forexample, memory 220 may store digital signature information 221 and oneor more hash functions 222, consensus algorithm 223, network protocols224, and network commands 225. In some arrangements, digital signatureinformation 221, hash functions 222, and/or network commands 225 maycomprise a wallet of full node computing device 210. Memory 220 mayfurther store blockchain 226. Each of digital signature information 221,hash functions 222, consensus algorithms 223, network protocols 224, andnetwork commands 225 may be used and/or executed by one or moreprocessors 211, ASIC devices 216, and/or GPUs 217 of full node computingdevice 210 to create and maintain a decentralized P2P network, requestexecution of network functions, and/or execute requested networkfunctions and maintain inter-nodal agreement as to the state ofblockchain 226.

For example, in order to create and maintain a decentralized P2Pnetwork, processors 211, ASIC devices 216, and/or GPUs 217 of full nodecomputing device 210 may execute network protocols 225. Execution ofnetwork protocols 225 may cause full node computing device 210 to form acommunicative arrangement with other full node computing devices andthereby create a decentralized P2P network. Furthermore, the executionof network protocols 225 may cause full node computing device 210 tomaintain the decentralized P2P network through the performance ofcomputational tasks related to the execution of network requests relatedto a blockchain such as blockchain 226. As will be described in detailbelow, the execution of such computational tasks (e.g., hash functions222, consensus algorithms 223, and the like) may cause full nodecomputing device 210 to maintain inter-nodal agreement as to the stateof a blockchain with other full node computing devices comprising thedecentralized P2P network.

In order to request execution of network functions, such as balancesheet transactions and/or smart contract operations, processors 211,ASIC devices 216, and/or GPUs 217 of full node computing device 210 mayexecute network commands 225 to broadcast the network function to adecentralized P2P network comprising a plurality of full nodes and/orlightweight nodes. The request may be digitally signed by full nodecomputing device 210 with usage of the private/public key informationand through execution of the digital signature algorithms of digitalsignature information 221.

In order to execute requested network functions and maintain inter-nodalagreement as to the state of a blockchain, processors 211, ASIC devices216, and/or GPUs 217 of full node computing device 210 may executenetwork protocols 224 to receive a broadcast of a requested networkfunction through a decentralized P2P network and from a requestingentity such as a full node or lightweight node. Processors 211, ASICdevices 216, and/or GPUs 217 of full node computing device 210 mayexecute hash functions 222 to generate a digest of the requested networkfunction. The resultant digest of the requested network function, inturn, may be hashed with the block hash of the most immediatelypreceding block of the blockchain. As will be described in furtherdetail below, processors 211, ASIC devices 216, and/or GPUs 217 of fullnode computing device 210 may execute consensus algorithms 223 toidentify a numerical value (e.g., nonce) corresponding to the particularexecuted consensus algorithm and related to the digest that combines thedigest of the requested network function and the block hash of the mostimmediately preceding block of the blockchain. The identification of thenumerical value enables processors 211, ASIC devices 216, and/or GPUs217 of full node computing device 210 to create a new block with a blockheader (e.g., block hash), which is a digest that combines the digest ofthe requested network function, the block hash of the most immediatelypreceding block, and the identified nonce. Processors 211, ASIC devices216, and/or GPUs 217 of full node computing device 210 may add the newblock to the blockchain based on network protocols 224 and broadcast thenew block to the other nodes in the decentralized P2P network.

As stated above, in some arrangements, a plurality of network functionrequests may be broadcasted across the decentralized network P2Pnetwork. Processors 211, ASIC devices 216, and/or GPUs 217 of full nodecomputing device 210 may execute network protocols 224 to receivebroadcast of each of the network functions through the decentralized P2Pnetwork and from the requesting entities. Processors 211, ASIC devices216, and/or GPUs 217 of full node computing device 210 may execute hashfunctions 222 to generate a hash tree (e.g., Merkle tree) of therequested network functions, which culminates in a single digest (e.g.,root digest, root hash, and the like) that comprises the digests of eachof the requested network functions. The root digest of the requestednetwork function, in turn, may be hashed with the block hash of the mostimmediately preceding block of the blockchain. Processors 211, ASICdevices 216, and/or GPUs 217 of full node computing device 210 mayexecute consensus algorithms 223 to identify a numerical value (e.g.,nonce) corresponding to the particular executed consensus algorithm andrelated to the digest that combines the root digest of the requestednetwork functions and the block hash of the most immediately precedingblock of the blockchain. The identification of the numerical valueenables processors 211, ASIC devices 216, and/or GPUs 217 of full nodecomputing device 210 to create a new block with a block header (e.g.,block hash), which is a digest that combines the root digest of therequested network functions, the block hash of the most immediatelypreceding block, and the identified nonce. Processors 211, ASIC devices216, and/or GPUs 217 of full node computing device 210 may add the newblock to the blockchain based on network protocols 224 and broadcast thenew block to the other nodes in the decentralized P2P network.

Furthermore, memory 220 of full node computing device 210 may storeblockchain 226. Blockchain 226 may include a blocks 227A, 227B, 227C, .. . 227 n, wherein block 227A represents the first block (e.g., genesisblock) of blockchain 226 and block 227 n represents the most immediateblock of blockchain 226. As such, the blockchain 226, which may be areplica or copy of the blockchain of the decentralized P2P network inwhich full node computing device 210 operates, may be a full or completecopy of the blockchain of the decentralized P2P network. Each of theblocks within blockchain 226 may include information corresponding tothe one or more network functions executed by the decentralized P2Pnetwork. As such, blockchain 226 as stored in memory 220 of full nodecomputing device 210 may comprise the totality of network functionsexecuted by the decentralized network.

FIG. 3B depicts an illustrative example of a lightweight node computingdevice 250 that may be used in accordance with one or more illustrativeaspects described herein. Lightweight node computing device 250 may beany of a personal computer, server computer, hand-held or laptop device,multiprocessor system, microprocessor-based system, set top box,programmable consumer electronic device, network personal computer,minicomputer, mainframe computer, distributed computing environment,virtual computing device, and the like and may operate in adecentralized P2P network. In some embodiments, lightweight nodecomputing device 250 may operate in a decentralized P2P network and maybe configured to request execution of network functions through thedecentralized P2P network. As such, lightweight node computing device250 may be different than full node computing device 210 in that it isnot configured to execute network functions and/or operate to maintain ablockchain of a decentralized P2P network. In other aspects, lightweightnode computing device 250 may have substantially the same physicalconfiguration as full node computing device 210, but configured withdifferent programs, software, and the like.

Lightweight node computing device 250 may include one or more processors251, which control overall operation of lightweight node computingdevice 250. Lightweight node computing device 250 may further includerandom access memory (RAM) 253, read only memory (ROM) 254, networkinterface 252, input/output interfaces 255 (e.g., keyboard, mouse,display, printer, and the like), and memory 260. Input/output (I/O) 255may include a variety of interface units and drives for reading,writing, displaying, and/or printing data or files. Lightweight nodecomputing device 250 may store in memory 260 operating system softwarefor controlling overall operation of the lightweight node computingdevice 250, control logic for instructing lightweight node computingdevice 250 to perform aspects described herein, and other applicationsoftware providing secondary, support, and/or other functionality whichmay or might not be used in conjunction with aspects described herein.

In comparison to full node computing device 210, lightweight nodecomputing device 250 might not include, in some instances, specializedhardware such as ASIC devices 216 and/or GPUs 217. Such is the casebecause lightweight node computing device 250 might not be configured toexecute network functions and/or operate to maintain a blockchain of adecentralized P2P network as is full node computing device 210. However,in certain arrangements, lightweight node computing device 250 mayinclude such specialized hardware.

Memory 260 of lightweight node computing device 250 may also store dataand/or computer executable instructions used in performance of one ormore aspects described herein. For example, memory 260 may store digitalsignature information 261 and one or more hash functions 222 and networkcommands 225. In some arrangements, digital signature information 261,hash functions 222, and/or network commands 225 may comprise a wallet oflightweight node computing device 250. Each of hash functions 222 andnetwork commands 225 stored in memory 260 of lightweight node computingdevice 250 may be respectively similar and/or identical to hashfunctions 222 network commands 225 stored in memory 220 of full nodecomputing device 210.

In regard to the digital signature information, each of digitalsignature information 261 stored in memory 260 of lightweight nodecomputing device 250 and digital signature information 221 stored inmemory 220 of full node computing device 210 may comprise similar and/oridentical digital signature algorithms. However, the private/public keyinformation of digital signature information 261 stored in memory 260 oflightweight node computing device 250 may be different than that of theprivate/public key information of digital signature information 221stored in memory 220 of full node computing device 210. Furthermore, theprivate/public key information of each node, whether full orlightweight, in a decentralized P2P computing network may be unique tothat particular node. For example, a first node in a decentralized P2Pcomputing network may have first private/public key information, asecond node may have second private/public key information, a third nodemay have third private/public key information, and so on, wherein eachof the private/public key information is unique to the particular node.As such, the private/public key information may serve as a uniqueidentifier for the nodes in a decentralized P2P computing network.

Each of digital signature information 261, hash functions 222, andnetwork commands 225 may be used and/or executed by one or moreprocessors 251 of lightweight node computing device 250 to requestexecution of network functions in a decentralized P2P network. Forexample, in order to request execution of network functions, such asbalance sheet transactions and/or smart contract operations, processors251 of lightweight node computing device 250 may execute networkcommands 225 to broadcast the network function to a decentralized P2Pnetwork comprising a plurality of full nodes and/or lightweight nodes.The request may be digitally signed by lightweight node computing device250 with usage of the private/public key information and throughexecution of the digital signature algorithms of digital signatureinformation 261.

Furthermore, memory 260 of lightweight node computing device 250 maystore blockchain 226. Blockchain 226 stored in memory 260 of lightweightnode computing device 250 may include at least block 227 n, whereinblock 227 n represents the most immediate block of blockchain 226. Assuch, the blockchain 226, which may be a replica or copy of theblockchain of the decentralized P2P network in which lightweight nodecomputing device 250 operates, may be a partial or incomplete copy ofthe blockchain of the decentralized P2P network. In some instances,however, blockchain 226 may include a blocks 227A, 227B, 227C, . . . 227n, wherein block 227A represents the first block (e.g., genesis block)of blockchain 226 and block 227 n represents the most immediate block ofblockchain 226. As such, the blockchain 226 may be a full or completecopy of the blockchain of the decentralized P2P network. Each of theblocks within blockchain 226 may include information corresponding tothe one or more network functions executed by the decentralized P2Pnetwork.

FIG. 4 illustrates an example of a computing system environment 400 thatmay be used according to one or more illustrative embodiments. Thecomputing system environment 400 is only one example of a suitablecomputing environment and is not intended to suggest any limitation asto the scope of use or functionality contained in the disclosure. Thecomputing system environment 400 should not be interpreted as having anydependency or requirement relating to any one or combination ofcomponents shown in the computing system environment 400.

The disclosure is operational with numerous other general purpose orspecial purpose computing system environments or configurations.Examples of well known computing systems, environments, and/orconfigurations that may be suitable for use with the disclosedembodiments include, but are not limited to, personal computers (PCs),server computers, hand-held or laptop devices, multiprocessor systems,microprocessor-based systems, set top boxes, programmable consumerelectronics, network PCs, minicomputers, mainframe computers,distributed computing environments that include any of the above systemsor devices, and the like.

With reference to FIG. 4, the computing system environment 400 mayinclude a computing device 401 wherein the processes discussed hereinmay be implemented. The computing device 401 may have a processor 403for controlling overall operation of the computing device 401 and itsassociated components, including random-access memory (RAM) 405,read-only memory (ROM) 407, input/output module or communications module409, and memory 415. Computing device 401 typically includes a varietyof computer readable media. Computer readable media may be any availablemedia that may be accessed by computing device 401 and include bothvolatile and nonvolatile media, removable and non-removable media. Byway of example, and not limitation, computer readable media may comprisea combination of computer storage media and communication media.

Computer storage media include volatile and nonvolatile, removable andnon-removable media implemented in any method or technology for storageof information such as computer readable instructions, data structures,program modules or other data. Computer storage media include, but isnot limited to, random access memory (RAM), read only memory (ROM),electronically erasable programmable read only memory (EEPROM), flashmemory or other memory technology, CD-ROM, digital versatile disks (DVD)or other optical disk storage, magnetic cassettes, magnetic tape,magnetic disk storage or other magnetic storage devices, or any othermedium that can be used to store the desired information and that can beaccessed by computing device 401.

Communication media typically embodies computer readable instructions,data structures, program modules or other data in a modulated datasignal such as a carrier wave or other transport mechanism and includesany information delivery media. Modulated data signal includes a signalthat has one or more of its characteristics set or changed in such amanner as to encode information in the signal. By way of example, andnot limitation, communication media includes wired media such as a wirednetwork or direct-wired connection, and wireless media such as acoustic,RF, infrared and other wireless media.

Computing system environment 400 may also include optical scanners (notshown).

Exemplary usages include scanning and converting paper documents, e.g.,correspondence, receipts to digital files.

Although not shown, RAM 405 may include one or more applicationsrepresenting the application data stored in RAM 405, while the computingdevice is on and corresponding software applications (e.g., softwaretasks) are running on the computing device 401.

Communications module 409 may include a microphone, keypad, touchscreen, and/or stylus through which a user of computing device 401 mayprovide input, and may also include one or more of a speaker forproviding audio output and a video display device for providing textual,audiovisual and/or graphical output.

Software may be stored within memory 415 and/or storage to provideinstructions to processor 403 for enabling computing device 401 toperform various functions. For example, memory 415 may store softwareused by the computing device 401, such as an operating system 417,application programs 419, and an associated database 421. Also, some orall of the computer executable instructions for computing device 401 maybe embodied in hardware or firmware.

Computing device 401 may operate in a networked environment supportingconnections to one or more remote computing devices, such as computingdevices 441, 451, and 461. The computing devices 441, 451, and 461 maybe personal computing devices or servers that include many or all of theelements described above relative to the computing device 401. Computingdevice 461 may be a mobile device communicating over wireless carrierchannel 471.

The network connections depicted in FIG. 4 include a local area network(LAN) 425 and a wide area network (WAN) 429, but may also include othernetworks. When used in a LAN networking environment, computing device401 may be connected to the LAN 425 through a network interface, such asLAN interface 423, or to an adapter in the communications module 409.When used in a WAN networking environment, the computing device 401 mayinclude a modem in the communications module 409, a modem separate fromthe communications module 409, such as modem 427, or other means forestablishing communications over the WAN 429, such as the Internet 431or other type of computer network. It will be appreciated that thenetwork connections shown are illustrative and other means ofestablishing a communication link between the computing devices may beused. Various well-known protocols such as TCP/IP, Ethernet, FTP, HTTPand the like may be used, and the system can be operated in aclient-server or in Distributed Computing configuration to permit a userto retrieve web pages from a web-based server. Any of variousconventional web browsers can be used to display and manipulate data onweb pages.

Additionally, one or more application programs 419 used by the computingdevice 401, according to an illustrative embodiment, may includecomputer executable instructions for invoking user functionality relatedto communication including, for example, email, short message service(SMS), and voice input and speech recognition applications.

Embodiments of the disclosure may include forms of computer-readablemedia. Computer-readable media include any available media that can beaccessed by a computing device 401. Computer-readable media may comprisestorage media and communication media and in some examples may benon-transitory. Storage media include volatile and nonvolatile,removable and non-removable media implemented in any method ortechnology for storage of information such as computer-readableinstructions, object code, data structures, program modules, or otherdata. Communication media include any information delivery media andtypically embody data in a modulated data signal such as a carrier waveor other transport mechanism.

Although not required, various aspects described herein may be embodiedas a method, a data processing system, or a computer-readable mediumstoring computer-executable instructions. For example, acomputer-readable medium storing instructions to cause a processor toperform steps of a method in accordance with aspects of the disclosedembodiments is contemplated. For example, aspects of the method stepsdisclosed herein may be executed on a processor on a computing device401. Such a processor may execute computer-executable instructionsstored on a computer-readable medium.

Referring to FIG. 5, an illustrative system 500 for implementing exampleembodiments according to the present disclosure is shown. Asillustrated, system 500 may include one or more workstation computers501. Workstations 501 may be local or remote, and may be connected byone of communication links 502 to computer network 503 that is linkedvia communication links 505 to blockchain based pricing system 504. Insystem 500, blockchain based pricing system 504 may comprise anysuitable server, processor, computer, or data processing device, orcombination of the same. Blockchain based pricing system 504 may be usedto process the instructions received from, and the transactions enteredinto by, one or more participants.

Computer network 503 may be any suitable computer network including theInternet, an intranet, a wide-area network (WAN), a local-area network(LAN), a wireless network, a digital subscriber line (DSL) network, aframe relay network, an asynchronous transfer mode (ATM) network, avirtual private network (VPN), or any combination of any of the same.Communication links 502 and 505 may be any communication links suitablefor communicating between workstations 501 and blockchain based pricingsystem 504, such as network links, dial-up links, wireless links, andhard-wired links.

The steps that follow in the Figures may be implemented by one or moreof the components in FIGS. 4 and 5 and/or other components, includingother computing devices.

Blockchain Based Pricing Systems

FIG. 6 shows a crypto-machine learning enabled blockchain based profilepricing system 600 in accordance with an aspect of the disclosure. Someor all of the components of crypto-machine learning enabled blockchainbased profile pricing system 600 may be included in the blockchain basedpricing system 504 described above regarding FIG. 5. System 600 caninclude a machine learning profile pricer 614 with one or moreinterfaces for communications with a user interface 626, blockchain node630, data storage 618, and blockchain distributed ledgers of financialinstruments in a plurality of blockchain nodes (referred to herein as“blockchain nodes/distributed ledgers 602”). Optionally, user interface626 and/or blockchain node 630 may be included within a crypto-machinelearning enabled blockchain apparatus or may be remote from such anapparatus, such as at a user location. The data storage 618 can comprisea high-performance in memory database, and at least some of theprocesses for determining a spread or other information for a quote,described further herein, can be determined in advance of receiving arequest for a quote and resulting data can be stored in data storage618. As examples, data storage 618 can store a plurality of userprofiles, e.g., in one or more databases, that can be used fordetermining information, such as spreads, quotes, and the like, inreal-time or near real-time with receiving a request for a quote, asdescribed herein. One or more user profiles can be further analyzed inresponse to receiving a request for a quote, and updated based on thatanalysis, e.g., for use in determining a spread, quote, or otherinformation in the future. In addition, the data storage 618 can includethird party data, such as from an Approved Publication Arrangement (APA)provider 622. For example, as part of a Markets in Financial InstrumentsDirective (“MiFID”) scheduled to enter into effect on Jan. 3, 2018,MiFID 2, APA providers will provide access to information such as quotesand trades from financial services institutions for a period of theprevious six months. Information such as pricing and a spread of aforeign currency exchange, e.g., the difference between a market priceand a quoted price, will be accessible. As examples, the data storage618 can host data from the prior six months of trades that were acceptedby a client from a third party, as well as data about quotes that wererejected by a client, including quotes from the financial institutiondetermining to provide a new quote to the client. The data storage 618can also host the data described above for a plurality of clients andpotential clients. A separate profile for each client, potential client,and/or third party can be maintained and stored at data storage 618 asone or more user profiles.

The machine learning profile pricer 614 may communicate with theblockchain nodes/distributed ledgers 602 via a secure gateway 610. Themachine learning profile pricer 614 may also communicate with, oroptionally include, an automated pricing workflow 606. In some examples,user interface 626 may be included in any of computing devices 441, 451,and 461. The user interface 626 can provide a mechanism for a user of acomputing device, such as a computing device 441, 451, or 461, tocommunicate with the machine learning profile pricer 614, viacommunication link 624. In an example, a user may be a client orpotential client of financial services, such as from a bank or otherfinancial services provider. Using a user interface 626, such as a touchscreen, keypad, or other input of a computing device 441, 451, or 461,the user may request from the financial services provider, viacommunication link 624, information, such as information relating tocurrency exchange, savings or lending interest rates, or othertransactions. The request may be received by, and/or further transmittedto, a machine learning profile pricer 614 used by the financial servicesprovider to generate information, such as a quote or spread for aparticular financial transaction, in response to such a user request. Inaddition, a user can also transmit user related information to themachine learning profile pricer 614, such as a username and/or password,a private key, or other information that can be used to identify and/orauthenticate a user. The user can also receive information from thefinancial services provider, such as in response to a user's request forinformation, via communication link 624. In addition, some or allinformation for communication between a user and the financial servicesprovider can be communicated between machine learning profile pricer 614and blockchain node 630, via communication link 632. Using userinterface 626, a user can transmit to, or receive such information from,blockchain node 630 via communication link 628. By using a blockchainnode 630 for exchanging communications between a user interface 626 anda machine learning profile pricer 614, information can be communicatedin a secure and transparent manner by using blockchain technology asdescribed above regarding FIGS. 1, 2, and 3.

According to one or more aspects, machine learning profile pricer 614may be used by a financial services provider to provide a customizedquote, or spread, for a financial service, including, e.g., a forextrade. The machine learning profile pricer 614 can receive user-relateddata, such as from user interface 626 and/or blockchain node 630. Themachine learning profile pricer 614 may also receive user-related datafrom an automated pricing workflow 606, which can be transmitted, viacommunication links 608 and 612, in a secure manner using a securegateway 610. In addition, the machine learning profile pricer 614 canreceive third party data, such as from APA provider 622. The machinelearning profile pricer 614 can store user-related data and/or thirdparty data in data storage 618, and using data from the data storage618, the machine learning profile pricer 614 can determine a customizedquote for financial service for the user in the manner further describedherein. In some embodiments, a cryptography machine learning enabledblockchain based apparatus may comprise one or more of the machinelearning profile pricer 614, secure gateway 610, automated pricingworkflow 606, and data storage 618.

In some examples, the automated pricing workflow 606 can be a mechanism,engine, or combination of engines, used by a financial services providerto determine financial related agreements between the provider and itsclients. Information from prior transactions, including, e.g.,agreements, quotes, spreads, requests, approvals, or rejections, can becommunicated from the automated pricing workflow 606 to the machinelearning profile pricer 614 for use in determining a customized quotefor a user. In addition, the automated pricing workflow 606 can receiveinformation from the machine learning profile pricer 614, such as newrequests for quotes, new quotes or spreads, new approvals or rejections,or new third party data, for storage, further analysis, or incorporationinto new agreements. The automated pricing workflow 606 can providereceived information or information it has determined, such asagreements, agreed terms, approvals, or rejections, for blockchainnodes/distributed ledgers 602 via communication link 604.

In some aspects, other forms of communications via one or more ofcommunication links, such as communication links 624, 628, 632, and 604,can include multi-lateral private message communications. As an example,if a “51%” blockchain problem is anticipated such that a singleblockchain user could obtain control of a majority or a near majority ofthe blockchains in a network in a manner that could render the networkvulnerable, one or more of the above communication links can usemulti-lateral private messages to communicate sensitive data. Asexamples, trade and pricing information, such as quotes, spreads, andtrade agreements, can be communicated via multi-lateral private messagesto prevent a “51%” blockchain attack. Upon a determination that thethreat of an attack has been eliminated, the communications can returnto using blockchains. Examples of communications and monitoring forpreventing such an attack are described below regarding FIG. 8.

By using blockchain nodes/distributed ledgers 602 for communicatinginformation to and from automated pricing workflow 606, information canbe communicated in a secure and transparent manner based on blockchaintechnology described above regarding FIGS. 1, 2, and 3. As examples,blockchain distributed ledgers can be stored in multiple blockchainnodes that can be capable of hosting trade and pricing (including, e.g.,spread) information, such as described above and further below regardingFIG. 10. Blockchain nodes/distributed ledgers 602 have advantages overother forms of communicating data such as trade and pricing information,including, e.g., advantages of immutability, security, traceability, andrecovery, described further below.

Immutability refers to something that is unchanging over time, or unableto be changed. In aspects of the disclosure, once data is written to ablockchain, that data cannot be changed—not even by a systemadministrator or other person having a high level of access.Communicating data via blockchains, as described herein, providesimmutability that is particularly advantageous from audit and complianceperspectives relevant to financial transactions. A provider of data thatcommunicates using blockchains as disclosed herein can prove that thedata has not been altered. Similarly, a recipient of data communicatedvia blockchains as disclosed herein can be assured that the data has notbeen altered.

Security is at a very high level with respect to blockchain basedcommunications disclosed herein. As an example, a trade agreement withpricing information can be highly sensitive to a party and should bestored and communicated in a secure manner to prevent exposure viasecurity breaches such as malware, fishing attacks, and others. Bycommunicating financially sensitive information via blockchainnodes/distributed ledgers 602, as described herein, this information canbe transferred and stored in a highly secure manner.

Traceability is another advantage of blockchain based communicationsdisclosed herein. As examples, transaction audit logs and othertraceability features of blockchain based communications disclosedherein provide support for preservation of pricing information andtransparency of transactions. As an example, if a party wants todetermine any changes made to an agreement, or wants to return to aprevious agreement or pricing information, the prior data of theblockchain is readily available and traceable to do so.

Data recovery can be an advantageous feature of blockchain basedcommunications disclosed herein. As described herein, a plurality ofblockchain nodes can each maintain a copy of blockchain distributedledgers in a network. Because multiple copies of a trade and pricinginformation are stored across a network, the information can be obtainedeven if it becomes unavailable at a particular blockchain node.

Each of communication links 604, 608, 612, 616, 620, 624, 628, and 632in FIG. 6 can include one or more communication links, including any ofthe types of communication links discussed above regarding FIGS. 4 and5. In addition, or alternatively, any of communication links 604, 608,612, 616, 620, 624, 628, and 632 can include wired or wirelesscommunication links within a single apparatus. As an example,communication links 608 and 612 may correspond to one or more wired orwireless communication links within a cryptography machine learningenabled blockchain based apparatus. As another example, communicationlink 616 may correspond to one or more wired or wireless communicationlinks within memory of a cryptography machine learning enabledblockchain based apparatus, such as within memory 415 of computingdevice 401 discussed above regarding FIG. 4. As still another example,communication links 604 and 632 may correspond to one or more wired orwireless communication links between a cryptography machine learningenabled blockchain based apparatus and one or more blockchain nodes 630or blockchain nodes/distributed ledgers 602.

Examples regarding receiving and providing a quote or spread for afinancial service in connection with aspects of the present disclosureare described with respect to FIGS. 7A and 7B as follows.

FIG. 7A depicts an example of a user 702 requesting a quote for afinancial service using a user interface 704, which may correspond tothe user interface 626 described above regarding FIG. 6, and a machinelearning profile pricer 614 receiving that request for a quote. Inaddition, data storage 618 described above can comprise a highperformance in memory database stored internal or local to machinelearning profile pricer 614. In some examples, the quote relates to anexchange of foreign currency (e.g., a forex trade), however, the quotecan be for any other transaction, including, e.g., a loan, a certificateof deposit, or any other financial service. The user 702 may include aclient or a potential client of financial services, identified as clientID 718, which can be entered by the client or potential client,automatically generated, or provided via another mechanism such as aclient log-in process, use of client-specific application or interface,communication of a private key, or any other identification mechanism.At input 706A, the user 702 can enter buy currency, for example, U.S.Dollars. Input 706A could include a quantity and type of the currency(e.g., $1,500,000), a range of currency (e.g., less than $500,000,between $500,000 and $1,000,000, or greater than $1,000,000), or anindication of only the type of buy currency (e.g., $). At input 708A,the user 702 can enter a sell currency, for example, Euros. Input 708Bcould include a quantity and type of the currency (e.g., EUR 1,500,000),a range of currency (e.g., less than EUR 500,000, between EUR 500,000and 1,000,000, or greater than EUR 1,000,000), or an indication of onlythe final type of currency (e.g., EUR). In addition, upon user 702entering data in either of inputs 706A or 706B, the user interface 704can automatically adjust options for the other input 706B or 706A,respectively. For example, if a user enters an indication of U.S.Dollars in input 706A, then the user interface 704 may exclude U.S.Dollars as an option for input 706B, e.g., providing other currencyoptions for exchanging U.S. Dollars such as Euros, Great Britain Pounds,and other currencies. As another example, if a user enters a specificamount and type of currency in input 706B, such as $1,000,000, the userinterface 704 may exclude both that currency type, e.g., U.S. Dollars,and an amount of currency as an option for input 706A, e.g., providingonly types of currency for exchanging U.S. Dollars such as Euros, GreatBritain Pounds, and the like. After user 702 enters data in inputs 706Aand 706B, the user can submit the inputs for a quote via a selectionmechanism 710, such as a “submit” button, carriage entry, voice command,fingerprint scan, or other input. The request for a quote can becommunicated to the machine learning profile pricer 614 viacommunication link 712. Communication link 712 can comprise one or moreof and communication link 624 and/or communication link 632 and operateas described above regarding FIG. 6.

FIG. 7B depicts an example of a user 702 receiving, and a machinelearning profile pricer 614 transmitting, a quote 706 for a financialservice at or to a user interface 704, which may correspond to the userinterface 626 described above regarding FIG. 6. As explained aboveregarding FIG. 7A, in this example, the quote relates to an exchange offoreign currency such as a forex trade, however, the quote can be forany other transaction, including, e.g., a loan, a certificate ofdeposit, or any other financial service. At input 706B, the buycurrency, for example, U.S. Dollars, can be displayed based on the input706A previously entered by the user 702 (e.g., shown here as “X”). Asabove, input 706B could include a quantity and type of the currency(e.g., $1,500,000), a range of currency (e.g., less than $500,000,between $500,000 and $1,000,000, or greater than $1,000,000), or anindication of only the type of buy currency (e.g., $). Optionally,unlike input 706A, input 706B can be presented on user interface 704 ina manner that cannot be changed by the user 702, except, e.g., byreturning to data input steps such as described above regarding FIG. 7A.At input 708B, the sell currency, for example, Euros, can be displayedbased on the input 708A previously entered by the user 702 (e.g., shownhere as “Y”). As above, input 708B could include a quantity and type ofthe currency (e.g., EUR 1,500,000), a range of currency (e.g., less thanEUR 500,000, between EUR 500,000 and 1,000,000, or greater than EUR1,000,000), or an indication of only the type of the sell currency(e.g., EUR). Optionally, unlike input 708A, input 708B can be presentedon user interface 704 in a manner that cannot be changed by the user702, except, e.g., by returning to data input steps described aboveregarding FIG. 7A. Finally, the quote 716 can be displayed on the userinterface 704 based on the inputs 706B and 708B. The quote 716 couldinclude a quantity and type of currency required to complete thetransaction (e.g., $1,000,000 to exchange an buy currency type of U.S.Dollars to a sell currency of EUR 1,100,000), a rate or fixed cost toexchange a range of currency from (e.g., 3% and/or $50,000 to exchangebetween $1,000,000 and $1,500,000 from U.S. Dollars to Euros), or anyother indication of a cost to the user (e.g., shown here as “Z”) toexchange the currency pursuant to inputs 706B and 708B. The quote 716can be communicated from the machine learning profile pricer 614 viacommunication link 714. Communication link 712 can comprise one or moreof and communication link 624 and/or communication link 632 and operateas described above regarding FIG. 6. Optionally, user interface 704 caninclude an indication of client ID 718, described above regarding FIG.7A.

Communication link 712 may be the same as, or different from,communication link 714. As an example, communication link 714 maycontain financial data (e.g., quote and spread information) havinggreater sensitivity than communications received from communication link712 (e.g., a request for a quote). As a result, communication link 712may be configured for greater security, such as for blockchaincommunications, than communication link 714. In addition, the quote 716can be displayed on user interface 704 at a time that can appear to theuser 702 to be instantaneous or near instantaneous of the userrequesting a quote via selection mechanism 710. That is, the processesof determining and communicating a quote, e.g., by machine learningprofile pricer 614, to a user 702 on a user interface 704 may be inreal-time or near real-time. As an example, these processes may beperformed within seconds, micro-seconds, nano-seconds, or other timeperiod such that a user 702 does not experience a delay from the time ofrequesting a quote (e.g., as described regarding FIG. 7A) to the time ofreceiving a quote displayed on user interface 704 (e.g., as describedregarding FIG. 7B). As additional examples, the time between receiving arequest for a quote described with respect to FIG. 7A and providing thequote 716 for display on user interface 704 (e.g., a second time period)may be substantially same as the time between transmitting the requestfor a quote via selection mechanism 710 and receipt of the quote, e.g.,at machine learning profile pricer 614 (e.g., a first time period). Insome embodiments the first time period may be the same as the secondtime period. In other embodiments, the second time period may be withina percentage greater than the first time period (e.g., 1%, 2%, 5%, 10%,25%, 50%, 100%). In other embodiments, the second period may be withinan order of magnitude greater than the first time period (e.g., a firsttime period of 0.1 second corresponding to a second time period of 1second or less). The described processes for determining andcommunicating a quote can be in real-time or near real-time, at least inpart, because data storage 618 can comprise a high-performance in memorydatabase and at least some of the processes for determining a spread fora quote can be determined in advance of receiving a request for a quote.As examples, data storage 618 can include one or more user profiles thatcan be generated, e.g., based on third party data from an APA provider622, at a time prior to receiving a request for a quote. One or moreuser profiles can be updated in response to receiving a request for aquote, to provide a quote or other information (e.g., a spread) that canbe in real-time or near real-time with receiving a request for a quote.

While FIGS. 7A and 7B and their corresponding description provide aspecific example of receiving a request for a currency exchange, andproviding a quote and/or spread in response thereto, the above can alsobe applied for any other transaction, including any transactionsregarding financial services, such as information relating to currencyexchange, savings or lending interest rates, or other financialtransactions.

FIG. 8 provides additional examples of aspects of the present disclosurerelating to blockchain based distributed shared contracts that may beimplemented by one or more of the components in FIGS. 4, 5, 6, 7A, 7Band/or other components, including other computing devices. FIG. 8depicts a plurality of users 802, 804, and 806 in a system 800 forsharing smart contracts 814A and/or 814B among a plurality of blockchainnodes 812A and 812B. While only two blockchain nodes 812A and 812B areshown, system 800 can include any number of blockchain nodes across anetwork. Smart contracts 814A and/or 814B can include a plurality ofinformation relevant to a transaction, including, e.g., quote 811A and811B, spread 813A and 813B, and any other data 815A and 815B. Quote 811Aand 811B can include a spread, currency pairs, currency amounts,transaction dates, client ID or other party identifier, and any otherinformation. In some examples, user 806 may correspond to user 70 inFIGS. 7A and 7B, a user at user interface 626 in FIG. 6, or any otheruser described herein. Users 802 and 804 may correspond to a user withthe same or different access rights as user 806. For example, user 802could correspond to a sales representative of a financial servicesprovider and may be able to access certain data related to a pluralityof clients or potential clients. As another example, user 804 couldcorrespond to a foreign exchange transactions representative of afinancial services provider and may be able to access the same data asuser 802 or additional data related to certain transactions involvingclients, potential clients, or third parties. Any number of users may beprovided with respective one or more various types of levels of accessof data in system 800.

Each user 802, 804, and 806 can communicate in system 800 via respectiveuser graphical user interfaces (GUIs) or other form of interface, suchas GUI 808A (e.g., by users 802 and 804) and GUI 808B (e.g., by user806). The GUIs 808A and 808B can operate in connection with one or moreapplications, such as respective Web applications (“Web Apps”) 810A and810B. As an example, GUIs 808A and 808B may include user interface 704described above regarding FIGS. 7A and 7B. Similarly, as an example, WebApps 810A and 810B can include a foreign currency exchange applicationsuch as that described above regarding FIGS. 7A and 7B. User GUI 808Aand Web App 810A may be the same or different from GUI 808B and Web App810B, respectively, depending on the type of user. For example, User GUI808A and/or Web App 810A may include additionally functionality and/ordata relative to GUI 808B and/or Web App 810B, respectively, e.g., ifusers 802 and 804 are representatives of a financial servicesinstitution that are provided with a greater level of access ofinstitutional data relative to user 806 that may be a client orprospective client of that financial services institution. Users 802,804, and 806 can use a Web App 810A and 810B, via a respective User GUI808A and 808B in a computer device, such as computing device 401described above, to communicate regarding a smart contract 812A and/or812B stored at a respective blockchain node 812A and/or 812B. Forexample, a user 804 at a financial services institution can receiveresults from a machine learning profile pricer 614 described aboveregarding FIG. 6, and based on the results, determine or update anagreement for a financial transaction (e.g., forex trade) with a client,such as user 806. The agreement or terms thereof can be included in asmart contract 814A, such as in smart contract operations describedabove. The smart contract can be stored in a blockchain node 812A, whichcan include, e.g., a blockchain node storing blockchain distributedledgers described above regarding FIG. 6. In addition, a copy of thesmart contract 812A can be stored as smart contract 814B in blockchainnode 812B. As an example, blockchain node 812B may correspond toblockchain 630 described above regarding FIG. 6, whereby smart contract814B may be communicated from machine learning profile 614 to blockchain630 via communication link 632. Users 802, 804, and 806 can access smartcontract 814A and/or 814B via a shared private key 816. For example,User 806 can access the agreement or terms thereof by using the user'sprivate key 816 to access smart contract 814B stored at blockchain node812B, or obtain a copy of smart contract 814A stored at blockchain node812A. By using blockchain technology with private/public key operations,such as described above regarding FIGS. 1, 2, and 3, information insmart contracts 814A and 814B can be communicated in a secure andtransparent manner among users authorized to access such information.

System 800 can optionally include a monitoring engine 818 incommunication with blockchain nodes 812A and 812B via communicationlinks 817. Monitoring engine 818 can be located at any location in anetwork, including, e.g., in a cryptography machine learning enabledblockchain based apparatus described herein or remote therefrom.Monitoring engine 818 can be used to monitor communications betweenblockchain nodes throughout a network, including, e.g., blockchain nodes812A and 812B. As examples, monitoring engine 818 can be used to detectand prevent a “51%” attack such as described above. In some embodiments,monitoring engine 818 can determine whether a party has control ofwithin a threshold amount of blockchains, such as 40%, 45%, 48%, 49%,50%, or 51%. If control of 50% or more of blockchain in a network by oneparty is detected, one or more communication links such as describedabove, e.g., regarding FIG. 6, can switch from using blockchains tousing multi-lateral private messages for communications of sensitivedata. Similar operations can be performed if control of a thresholdamount below 50% (e.g., 49%, 48%, 45%, 40%) of blockchains by one partyis detected so as to prevent a “51%” attack. As another example, ifmonitoring engine 818 detects one party, or a number of related parties,obtains or appears to attempt to obtain a threshold amount ofblockchains that could lead to a “51%” or similar attack on theblockchain network, additional monitoring can be performed, such asincreasing frequency of monitoring activities or adjusting to anincreased level of security, e.g., using permissioned blockchains. If atany point in time a “51%” attack is anticipated or detected, any of theblockchain communications described herein can be switched, eitherpermanently or temporarily, to using multi-lateral private messages forcommunications. If a threat subsides, multi-lateral private messages forcommunications can return to blockchain communications.

FIG. 9 shows a process 900 in accordance with various aspects of thedisclosure, e.g., with respect to quotes and agreements. This process900 discloses some steps that may be automatically performed, e.g., inreal-time or near real-time, by the machine learning profile pricer 614,automated pricing workflow 606, or a combination thereof, such as in acryptography machine learning enabled blockchain based apparatus. Theprocess 900 can begin at step 901 with receiving a quote request. As anexample, a cryptography machine learning enabled blockchain basedapparatus may receive a request for a quote from a user for a currencyexchange, or forex trade, such as described above regarding FIG. 7A. Asother examples, a quote request can be for any other transaction,including any transactions regarding financial services, such asinformation relating to currency exchange, savings or lending interestrates, or other financial transactions. At step 901, the receivedrequest can also be analyzed to identify the user if the user has notalready been identified such as via a user login. At step 902, recentactivity of the user, or requestor of the quote, can be analyzed. Forexample, a machine learning profile pricer 614 such as described aboveregarding FIG. 6 may analyze data associated with the user that may bestored in data storage 618. Additionally, or alternatively, an automatedpricing workflow 606 such as described above regarding FIG. 6 mayanalyze prior agreements, quotes, quote acceptances, or quote approvals.Analysis in step 902 can include retrieving and/or updating informationfrom one or more user profiles previously stored in data source 618,described above. At step 904, the cryptography machine learning enabledblockchain based apparatus can determine whether the user rejected aprior quote, including, e.g., the quote most recently provided to theuser. As an example, this determination can be performed by analyzingone or more user profiles previously stored in data source 618. If theprior quote was not rejected by the user, or was accepted by the user,the cryptography machine learning enabled blockchain based apparatus canmaintain pricing information for the user, at step 908, following the“No” path from step 904. If, however, the prior quote was rejected bythe user, following the “Yes” path from step 904, the apparatus candetermine data relevant to an asset class of the quote, at step 906.Asset classes can include any categorization of assets, such as foreignexchanges, rates, commodities, and credit, described further belowregarding FIG. 10. For example, if a quote is requested for an exchangeof U.S. Dollars to Euros, then relevant data can include priortransactions involving an exchange of U.S. Dollars to Euros and/or Eurosto U.S. Dollars. Relevant data of an asset class can be further narrowedto data specific to the quote requestor, such as prior acceptances orrejections of a quote, prior trades, transaction amounts, transactiondates, and any other information specific to a quote requestor, all ofwhich may be stored in data storage 618 prior to step 901.

A quote can also be customized based on third party data. For example,third party data can be received from an APA provider 622, and stored indata storage 618, as described above regarding FIG. 6, including, e.g.,prior to step 901. A machine learning profile pricer can analyze thethird party data, at step 910. For example, as described above, as partof MiFID 2, APA providers will provide access to information such asquotes and trades from financial services institutions for a period ofthe previous six months. Information such as pricing and a spread of aforeign currency exchange, e.g., the difference between a market priceand a quoted price, will be accessible. This information can beanalyzed, at step 910, as part of process 900 to provide customizedtrade and pricing information, such as quotes. Additionally, oralternatively, analysis at step 910 can be initially performed prior tostep 901 and supplemented with updated information at step 910, to helpfacilitate providing a quote in real-time or near real-time with arequest for a quote. As an example of the analysis of third partyquotes, some or all quotes accepted by the same requestor, or user,given by a competing financial institution, or rival bank, during a timeperiod (e.g., 6 months, 3 months, 1 month, or any other period of time)for the same financial instrument (e.g., forex of the same currencytypes) can be identified and analyzed. In some examples, a regressionanalysis can be performed on this third party data, such as representedin the following equation:

${{Proposed}\mspace{14mu}{quote}} = {{Constant} + {\sum\limits_{i = {n - 1}}^{i = 0}{{Coefficient}*{Quote\_ given}{\_ by}{\_ rival}{\_ bank}}}}$where “constant” and “coefficient” are a constant term and one or morecoefficients, respectively, in a regression equation, “n” is the numberof values analyzed, and “Quote_given_by_rival_bank” represents the valueof a third party quote previously accepted by the same requestor for the“proposed quote.” Regression analysis can be performed prior to step901, e.g., using information from user profiles previously stored indata storage 618. In addition, regression analysis can be updated, e.g.,by performing fewer operations, such as a single series of the above orsimilar equation and combining it with one or more of a plurality ofpreviously analyzed series of the above or similar equation. In thisway, information used for generating quotes, spreads, and the like, canbe updated incrementally, in real-time or near real-time, as data isreceived from APA provider 622 and/or from each performance of one ormore steps in response to a request for a quote, such as describedherein for process 900. While shown above more generally, additionalexamples of a regression analysis are described below regarding FIG. 13.

Based on the above information and analysis, an apparatus can determinea quote, at step 912, and provide the quote to a user at step 914. Forexample, a machine learning profile pricer 614 can provide a quote to auser via communication link 624 and/or communication link 632 asdescribed above regarding FIG. 6. As another example, a machine learningprofile pricer 614 can provide a quote via communication link 714 asdescribed above regarding FIG. 7B. As another example, a quote can becommunicated from one user, e.g., user 802 or user 804, to another user,e.g., user 806, via the system 800 described above regarding FIG. 8.

An acceptance of a quote can be received at step 916. Acceptance can beperformed by a user providing a command via a user interface, such asuser interface 626 described above regarding FIG. 6. As another example,an interface such as interface 704 can be included in a user's computingdevice, and a user can confirm acceptance of the quote in a manner suchas described above regarding FIG. 7B. If an acceptance of the quote isreceived, the process continues via the “Yes” path from step 916 to step918. At step 918, a transaction corresponding to the quote can beapproved. For example, an automated pricing workflow 606, such asdescribed above regarding FIG. 6, can approve a transaction of a forextrade corresponding to a quote provided to and accepted by a user. Ifacceptance of the quote is not received, or if the quote is rejected,the process can continue to step 920 via the “No” path from step 916. Atstep 920, it can be determined whether the process 900 should continue.For example, step 920 could be based on an expiration timer or theoccurrence of a particular event, such as a change in relevant currencytransaction rates. If it is determined at step 920 that the process 900should not continue, or if the transaction is approved at step 918, theprocess 900 can end. If, however, it is determined that the processshould continue at step 920, then an update can be performed at step 922such that recent activity of the quote requestor can be furtheranalyzed. For example, if the user has not accepted a quote within athreshold time period, or if it is determined that the user has acceptedone or more quotes from a third party, an updated analysis can provideadditional information that can be used in a repetition of the process900, e.g., to determine relevant data, analyze third party quotes,determine a new quote, and provide that new quote to the user that mayhave an increased likelihood of acceptance by the user.

FIG. 10 shows a blockchain system 1000 for blockchain distributedledgers 1010 in accordance with an aspect of the disclosure. While someexamples disclosed herein are provided with respect to forex trade orrelated transactions, system 1000 can include plurality of blockchainnodes each of which can host one or more of a variety of assetcategories, including, e.g., a foreign exchanges (e.g., “Forex”) node1004, a “Rates” node 1002, a “Commodities” 1008, and a “Credit” node1006. Each assert category can include one or more of blockchain nodes1002, 1004, 1006, or 1008. Each of the systems, apparatuses, and methodsdescribed herein can be applied to any type of data, including to eachof the asset categories described with respect to FIG. 10. Informationcan be communicated among the blockchain nodes 1002, 1004, 1006, or 1008using blockchain distributed ledgers 1010 in accordance with blockchainoperations described above. As an example, system 1000 can operate as acollection of blockchain nodes for storing the blockchain distributedledgers, described above regarding FIG. 6. For example, system 1000 cancommunicate with automated pricing workflow 606 via communications link604. Each blockchain node 1002, 1004, 1006, and 1008 is distributed andverifiable across the blockchain system 1000 using public and privatekeys. While trade and pricing information can be published to allparties available to the blockchain system 1000, only an intendedrecipient who has a private key for a transaction may be able to accessinformation regarding the transaction. As another example, theblockchain communications described herein may be permissionedblockchains, whereby various restrictions may be placed on certainblockchain nodes which can lead to overall increased privacy,transaction speed, and control.

FIG. 11 shows a process 1100 relating to pricing agreements inaccordance with various aspects of the disclosure. This process 1100discloses some steps that may be automatically performed, e.g., inreal-time or near real-time, by the automated pricing workflow 606, themachine learning profile pricer 614, or a combination thereof, such asin a cryptography machine learning enabled blockchain based apparatus.The process 1100 can begin at step 1102 with determining to change apricing agreement. As an example, a user may accept a quote for acurrency exchange, such as described above regarding process 900 in FIG.9, rendering a desire for a new pricing agreement based on the acceptedquote. As another example, a user may not accept a quote, or a user mayreject a quote, and in response it can be determined that a change in apricing agreement should be proposed, e.g., to increase a likelihoodthat the user may accept it.

After it is determined that a change in a pricing agreement should bemade, a proposed pricing agreement can be determined at step 1104. Theproposed pricing agreement may be based on a prior pricing agreementthat can be revised, e.g., to incorporate an accepted quote, or toaccount for a rejection or a lack of acceptance of a quote. One or moreprior pricing agreements can be stored in data storage 618, as describedabove. After the proposed pricing agreement is determined, it can beanalyzed at step 1106. For example, an automated pricing workflow 606 asdescribed above regarding FIG. 6 can analyze the proposed pricingagreement, e.g., in real-time or near real-time, to determineappropriateness of terms based on a profile associated with the userand/or based on third party data related to agreements for similartransactions. Terms can include, e.g., rates, costs, spread, marketprice, quoted price, currency types, currency amounts, time periods,identification of parties, and any other term relevant to a pricingagreement. Based on the analysis of the proposed pricing agreement, itcan be determined whether to approve the pricing agreement, at step1108. The approval of the pricing agreement can be an automated process,a manual process, or a combination of both. For example, upondetermination of one or more terms satisfying one or more thresholds orranges of thresholds, the pricing agreement may be automaticallyapproved; whereas upon determination of one or more terms fallingoutside one or more of the above thresholds or ranges of thresholds but,e.g., still satisfying other conditions, further analysis may require amanual process for approving the pricing agreement. If a pricingagreement is not approved, it can be determined whether further analysisshould be performed, at step 1110. If it is determined that furtheranalysis should be performed, e.g., if one or more terms are identifiedas potentially revisable (e.g., if it includes a spread or a rate thatis not a minimum spread or rate the party has provided to a differentclient for the same type of transaction), then at step 1112 via the“Yes” path of step 1110, a revised proposed pricing agreement can bedetermined, and the process can continue to step 1106 described abovefor analysis and approval of the revised proposed pricing agreement. Asanother example, if a proposed pricing agreement includes a rate that isinconsistent with a rate for another agreement with the same user, thenthe proposed agreement could be revised to include the same rate as theother agreement with that user. If, however, it is determined thatfurther analysis should not be performed, e.g., if the proposed termswere consistent with other accepted agreements and further revisions aredeemed unnecessary or disadvantageous to the offering party, then theprocess 1100 can end via the “No” path from step 1110.

After a pricing agreement is approved, process 1100 can continue via the“Yes” path from step 1108. The approved pricing agreement can beprovided to the customer, or user, at step 1114. As an example, apricing agreement can be communicated from a machine learning profilepricer 614 to a blockchain node 632, via communication link 632, incommunications such as described above regarding FIG. 6. The user canuse a user interface 626 to view the agreement upon accessing it viacommunication link 628. Additionally, or alternatively, the pricingagreement can be communicated from a machine learning profile pricer 614to a user interface 626 via communication link 624. The agreement canalso be in the form of a smart contract, such as described aboveregarding the smart contract 814B in FIG. 8, that the user can accessusing a shared private key 816. Upon determining that the agreement isacceptable, the user may provide an indication of acceptance orrejection via communication link 628 and/or communication link 632. Atstep 1116, a response from the customer, or user, can be received. Theresponse can be analyzed, at step 1118, to determine whether thecustomer has accepted the pricing agreement. In some examples, a timercan be used, whereby a failure to receive an indication of acceptancewithin a period of time results in a determination that the pricingagreement has not been accepted. If acceptance is not confirmed, thenthe process 1100 can return to step 1110, where it is determined whetherthe process should continue, as described above. If acceptance of thepricing agreement is confirmed, however, the process can continue tostep 1120.

At step 1120, customer data can be updated based on the accepted pricingagreement. For example, one or more user profiles stored in data storage618 can be updated to reflect one or more terms of the pricingagreement, such as rate, cost, spread, market price, quoted price,currency types, currency amounts, time periods, and any other termrelevant to the pricing agreement and the customer or user. The pricingagreement can be recorded at step 1122. For example, the pricingagreement can be stored as a smart contract 814A at blockchain node812A, described above regarding FIG. 8. Finally, the process 1100 caninclude a determination of whether any additional changes should bemade, at step 1124. For example, if market conditions or other factorschange from the time the pricing agreement was approved at step 1108,the process 1100 can return to step 1102 to determine whether to proposea change in the pricing agreement. Step 1124 can be performed at anytime. In some examples, step 1124 can be performed in response a timeror predetermined change in one or more conditions relevant to a pricingagreement, such as changes in market prices of currency above or below athreshold, or the identification of a third party contract with thecustomer having different terms than the pricing agreement. If it isdetermined that no additional changes should be made to the pricingagreement, the process 1100 can end via the “No” path from step 1124.

Referring now to FIG. 12, a high-level diagram of an example of animplementation of an automated pricing workflow 1200 is shown. Some orall of the automated pricing workflow 1200 of FIG. 12 can be amechanism, engine, or combination of engines implemented in theautomated pricing workflow 606 described above regarding FIG. 6. Theautomated pricing workflow 1200 may be a component in a cryptographymachine learning enabled blockchain based apparatus described herein.The automated mechanism 1200, in this example, includes a banking system1202 comprising a client pricing workflow system 1204, databases 1206and 1212, and portals 1226, 1228, and 1240 for communications withcomputing devices 1234 and 1230, and with blockchain ledgers 1238,respectively.

The client pricing workflows system 1204 provides an automated mechanismfor trade agreements, including, e.g., to build, sign, approve, modify,and notify the trade agreements. Trade agreements agreement can containthe same or similar information as pricing agreements described above,and the processes described herein with respect to pricing agreementscan also be applied to trade agreements. Similarly, the processesdescribed herein with respect to trade agreements can also be applied topricing agreements. In addition, the processes described herein withrespect to quotes can also be applied to spreads or other trade orpricing information. And, the processes described herein with respect tospreads or other trade or pricing information can also be applied toquotes. In some examples, trade agreements contain information regardinga trade, such as an exchange of foreign currency, that has taken placebetween a buyer such as a user or client, and a seller such as a bank orother financial institution. In some examples, pricing agreementscontain information regarding an accepted quote for a trade, such as aforex trade, that may not have yet taken place. Client pricing workflowssystem 1204 can include a plurality of engines, such as an approvalsengine 1216, a modifications engine 1218, a notification engine 1220, anagreement lookup engine 1222, a signing engine 1224, and any otherengine for performing operations relating to trade agreements. Approvalsengine 1216 and signing engine 1224 carry out the trade approval andsigning processes, respectively, by both parties to a trade (e.g.,client and bank). Agreement lookup engine 1222 performs operationsregarding review of the pricing plan and analysis of the impact anagreement may have on other operations. Modification engine 1218performs operations for updating and editing trade agreements.Notification engine 1220 performs operations for notification services,such as emails or other notification during the process of building,signing, approving, and modifying trade agreements. One or more of theabove engines 1216, 1218, 1220, 1222, and 1224 can perform one or moresteps of the processes 900, 1100, and 1300 described herein regardingFIGS. 9, 11, and 13, respectively.

Banking system 1202 can include client pricing workflows system 1204 inaddition to one or more customer databases 1212, one or more APAdatabases 1206, and one or more mobile portal 1226, online portal 1228,and blockchain portal 1240. Customer database 1212 includes a pluralityof customer profiles 1214. Each customer may have a different customerprofile 1214. In some examples, similar customers may be grouped intogroups of customer profiles 1214. APA database includes third partytrade data 1208. This third party trade data 1208 includes informationregarding trades occurring during a prior time period, such as theprevious six months, three months, one month, or any other time period.Third party trade data 1208 can include data from trades betweencustomers and third parties, from non-customers and third parties, or acombination or both. Third party trade data 1208 can also includeinformation from proposed trades (e.g., quotes, spreads, and others),including accepted trades, rejected trades, expired trades, repeattrades, or any other category of trades. Third party trade data 1208 canbe stored in data storage 618 described above regarding FIG. 6. Thirdparty trade data 1208 can also be used in the processes described above,such as in the analysis of prior third party quotes in step 910 ofprocess 900 and in the analysis of a proposed pricing agreement in step1106 of process 1100. Customer database 1212 and APA database 1206 canbe used by client pricing workflows system 1204 to provide customer andthird party information for the processes performed by engines 1216,1218, 1220, 1222, and 1224.

Each portal 1226, 1228, and 1240 can enable banking system 1202 tocommunicate with another device. For example, mobile portal 1226 canenable banking system 1202 to communicate with mobile computing device1234 through which a user may communicate using a mobile application1236, which may correspond to Web App 810B described above regardingFIG. 8. As another example, online portal 1228 can enable banking system1202 to communicate with computing device 1230 through which a user maycommunicate using a web browser 1232, or any other user interface suchas user interface 626 described above regarding FIG. 6. As anotherexample, blockchain portal 1240 can enable banking system 1202 tocommunicate with blockchain nodes/distributed ledgers 1238, which maycorrespond to blockchain nodes/distributed ledgers 602 described aboveregarding FIG. 6.

FIG. 13 depicts an illustration of a process 1300 relating to a profilepricer in accordance with various aspects of the disclosure. Thisprocess 1300 includes some steps that may be automatically performed,e.g., in real-time or near real-time, by the machine learning profilepricer 614, the automated pricing workflow 606, or a combinationthereof, such as in a cryptography machine learning enabled blockchainbased apparatus. In addition, any one or more steps in process 1300 canbe performed in advance of receiving a request for a quote, to assist inproviding a spread or quote in real-time or near real-time as describedherein. The process 1300 can begin at step 1302 with a determination ofan initial currency type (e.g., a buy currency), a final currency type(e.g., a sell currency), and an amount of either to exchange in a forextrade. At step 1304, a competing institution, or a rival, for the forextrade can be determined or identified and trade information for thatrival can be obtained. As an example, rival trade information can beobtained from an APA provider, such as APA provider 622 described aboveregarding FIG. 6. At step 1306, a profile pricer can determine orreceive indications, for the currency determined at step 1302, each of atrader's inclination (“TI”) to complete a trade, the forex trader's (orquote offeror's) liquidity (e.g., “L”), and the rival's spread (e.g.,“RS”) for the forex trade. The value of a trader's inclination cancorrespond to a general market sentiment on the particular currencypair. For example, a currency that has a high volatility level or a weeklong-term outlook may have a low value for TI (e.g., 0.215, 0.546, or0.719), and a currency with low volatility or a strong long-term outlookmay have a low value for TI (e.g., 1, 0.961, or 0.895). The value for TIcan range from 0 to 1. The value of a quote offeror's liquidity, L, canbe determined by dividing its total assets by its total liabilities.Liquidity can be in relation to the particular currency at issue, or fora plurality of currencies, or all currencies. As an example, a value ofL is preferably above 1. The rival's spread, RS, can be based on therival trade data. For example, quotes received from the rival and/ortrades made by the rival can indicate a spread for each quote or trade,and that spread can correspond to RS.

At step 1308, a regression analysis can be performed. As an example, amulti-linear regression can be performed, such as described above, witha proposed quote as a dependent variable, and with historical liquiditydata L, trader inclination data TI, and rival spread data RS asindependent variables. Based on this regression, values for a constantor y-intercept, C₁, and coefficients C₂, C₃, and C₄, can be determined,at step 1310. Constant C₁ can correspond to a particular intercept pointon a standard deviation curve, and coefficients C₂, C₃, and C₄, canprovide correspond to weighted coefficient for each of TI, L, and RS,respectively.

At step 1312, an intermediate equation, Eq. 1, can be determined asfollows:Eq. 1=C ₁ +C ₂TI+C ₃L

Next, one or both of steps 1314 and 1316 can be performed, as follows.At step 1314, the rival's latest spread (e.g., “LS”) for a forex tradeof the currency can be determined and multiplied with coefficient C₄(e.g., to yield C₄LS) to provide a weighted LS value. Additionally, oralternatively, at step 1316 a cumulative running average (e.g., “RA”) ofthe rival's prior spreads over a period of time or over a number oftrades can be determined and multiplied with C₄ (e.g., to yield C₄RA) toprovide a weighted RA. As an example, if a rival's spread from its twomost recent trades of the currency at issue was 0.8 and 0.9, thecumulative running average is 0.85 (i.e., (spread₁+ . . . spread_(n))/n,where n is the number of rival trades considered).

If step 1314 is performed, at step 1318, the value from Eq. 1 is addedto the value from step 1314 in Eq. 2, shown below. Similarly, if step1316 is performed, at step 1320, the value from Eq. 1 is added to thevalue from step 1316 in Eq. 3, shown below:Eq. 2=Eq.1+C ₄LSEq. 3=Eq.1+C ₄RAUltimately, the above equations can be represented as follows, where arival's spread RS can represent, e.g., a latest spread (LS) or acumulative running average (RA):Eq. 4=C ₁ +C ₂TI+C ₃L+C ₄RS

The process 1300 can conclude in one of three ways. In a first way, atstep 1322, the value of Eq. 2 can be compared with the value of Eq. 3,and the lowest of the two values can be selected and, at step 1324,provided as a spread in a quote. In a second way, steps 1322, 1314, and1318 can be skipped and, at step 1324, the value of Eq. 3 can beprovided as a spread in a quote. And, in a third way, steps 1322, 1316,and 1320 can be skipped and, at step 1324, the value of Eq. 2 can beprovided as a spread in a quote. Thus, a quote can be provided invarious ways that each provide a spread for a customized quote based ona rival's trade information as described above. Each of the above stepsin process 1300 can be performed in an automated manner, e.g., inreal-time or near real-time. One or more of the above steps in process1300 can be performed simultaneously, or in different a different orderas shown. For example, the equation shown above as “Eq. 4” can beperformed in place of separate steps 1312 and 1318, or in place ofseparate steps 1312 and 1320. Alternatively, one or more steps could beperformed manually. The spread provided at step 1324 can be transmitted,e.g., in a quote, to a user using blockchain technology describedherein. As an example, the spread at step 1324 can be provided in quoteby machine learning profile pricer 614 to a blockchain node 630 viacommunication link 632, and/or to a user interface 626 via communicationlink 624 or communication link 628, as described above regarding FIG. 6.As another example, one or more steps of process 1300 can be performedin one or more of steps 910, 912, and 914 described above regarding FIG.9. As another example, the spread provided at step 1324 can be includedin quote 716 described above regarding FIG. 7B. Any other examples forproviding a quote to a user as described herein may use one or moresteps in process 1300.

Although the subject matter has been described in language specific tostructural features and/or methodological acts, it is to be understoodthat the subject matter defined in the appended claims is notnecessarily limited to the specific features or acts described above.Rather, the specific features and acts described above are described asexample implementations of the following claims.

We claim:
 1. A method for generating a real-time or near real-time quotefor an exchange of foreign currency comprising: receiving, by a machinelearning profile pricing server, third party data of a plurality ofexchanges of foreign currency; determining, by one or more processorsand using the third party data, a plurality of user profiles, wherein afirst user profile of the plurality of user profiles is associated witha first user that is a party to at least one of the plurality ofexchanges of foreign currency; storing before a first time, in one ormore databases, the plurality of user profiles; receiving, at the firsttime and from a first computing device, a request for a quote for anexchange of foreign currency, wherein the request comprises anindication of a buy currency and an indication of a sell currency;generating the quote using the machine learning profile pricing serverand based on information corresponding to historical acceptance ofsimilar quotes, wherein the quote comprises a proposed spread generatedby: determining a first user spread for one or more exchanges of the buycurrency and the sell currency by the first user; performing aregression analysis to calculate: an intercept constant; and one or morecoefficients for: an indication of market conditions; an indication ofliquidity; and the first user spread; summing results from theregression analysis; based on analysis of a previous smart contact,transmitting, at a second time, via a permissioned blockchaindistributed ledger accessible via a private key and to a plurality ofblockchain nodes, an indication of the quote, wherein a differencebetween the second time of the transmitting and the first time of thereceiving of the request is such that the quote is provided for display,as a smart contract visualization on a user interface of the firstcomputing device, in real-time or near real-time with the request;receiving, by an approvals engine and from the user interface of thefirst computing device based on the private key, an indication ofacceptance or rejection of the smart contract; and executing a datatransfer based on acceptance of the smart contract being received fromthe user interface of the first computing device and acceptance receivedfrom a second computing device of a computing system associated with thequote.
 2. The method of claim 1, wherein the determining the first userspread comprises determining a cumulative running average of spreadsfrom a plurality of accepted trades by the first user.
 3. The method ofclaim 1, wherein the determining the first user spread comprisesdetermining a spread from a most recent accepted trade by the firstuser.
 4. The method of claim 1, wherein the determining the first userspread comprises: determining a cumulative running average of spreadsfrom a plurality of accepted trades by the first user; determining aspread from a most recent accepted trade by the first user; andselecting, as the first user spread, a lesser of: the cumulative runningaverage of spreads; and the spread from the most recent accepted trade.5. The method of claim 1, further comprising adjusting the quote basedon a comparison of the quote with one or more quotes that were notaccepted.
 6. The method of claim 1, wherein the one or more coefficientscomprises a first coefficient, a second coefficient, and a thirdcoefficient, and wherein performing the summation using results from theregression analysis comprises a summation of: the intercept constant; aproduct of the first coefficient and the indication of marketconditions; a product of the second coefficient and the indication ofliquidity; and a product of the third coefficient and the first userspread.
 7. The method of claim 1, further comprising receiving, from thefirst computing device, an indication that the quote is acceptable;determining, based on the quote, a pricing agreement; and transmitting,via the permissioned blockchain distributed ledger and to the pluralityof blockchain nodes, the smart contract comprising the pricingagreement.
 8. The method of claim 1, wherein one or more of thedetermining the first user spread and the performing the regressionanalysis are performed prior to the first time.
 9. The method of claim1, wherein receiving the third party data comprises receiving the thirdparty data from an Approved Publication Arrangement provider.
 10. Themethod of claim 1, comprising: comparing, by a monitoring engine, anindicia of control of an amount of blockchains to a threshold condition;switching, based on the comparing and on meeting the thresholdcondition, communications to using multi-lateral private messages forcommunications; and switching, based on the comparing, communicationsfrom multi-lateral private messages to blockchain communications whenthe threshold condition is not met.
 11. A cryptography machine learningenabled blockchain based apparatus, the apparatus comprising: one ormore interfaces for communications with a plurality of users and aplurality of blockchain nodes; one or more processors configured toexecute computer-executable instructions; and memory storing thecomputer-executable instructions that, when executed by the one or moreprocessors, cause the apparatus to: receive third party data of aplurality of exchanges of foreign currency; determine, by one or moreprocessors and using the third party data, a plurality of user profiles,wherein a first user profile of the plurality of user profiles isassociated with a first user that is a party to at least one of theplurality of exchanges of foreign currency; store, before a first timeand in the memory, the plurality of user profiles; receive, at the firsttime, via the one or more interfaces, and from a first computing device,a request for a quote for an exchange of foreign currency, wherein therequest comprises an indication of a buy currency and an indication of asell currency; generate the quote, wherein the quote comprises a smartcontract including a private key and a proposed spread, and wherein togenerate the quote the instructions, when executed by the one or moreprocessors, cause the apparatus to: determine a first user spread forone or more exchanges of the buy currency and the sell currency by thefirst user; perform a regression analysis to determine: an interceptconstant; and one or more coefficients for:  an indication of marketconditions;  an indication of liquidity; and  the first user spread;perform a summation using results from the regression analysis;determine, based on an analysis of existing blocks of a permissionedblockchain distributed ledger, whether a similar quote has beenrejected; transmit, at a second time, via the permissioned blockchaindistributed ledger accessible via a private key, and to the plurality ofblockchain nodes, the smart contract comprising an indication of thequote, wherein a difference between the second time of transmission ofthe indication of the quote and the first time of the receipt of therequest for a quote is such that the quote is provided for display, as asmart contract visualization on a user interface of the first computingdevice, in real-time or near real-time with the request; receive, viathe smart contract from the user interface of the first computing devicebased on the private key, an indication of acceptance or rejection ofthe smart contract; receive, via the smart contract from a secondcomputing device of a computing system associated with the quote andbased on the private key, an indication of acceptance or rejection ofthe smart contract; and initiate execution of a data transfer based onan indication of acceptance of the smart contract being received fromthe user interface of the first computing device and an indication ofacceptance received from a second computing device of a computing systemassociated with the quote.
 12. The cryptography machine learning enabledblockchain based apparatus of claim 11, wherein the computer-executableinstructions, when executed by the one or more processors, further causethe apparatus to determine the first user spread using a cumulativerunning average of spreads from a plurality of accepted trades by thefirst user.
 13. The cryptography machine learning enabled blockchainbased apparatus of claim 11, wherein the computer-executableinstructions, when executed by the one or more processors, further causethe apparatus to determine the first user spread using a most recentaccepted trade by the first user.
 14. The cryptography machine learningenabled blockchain based apparatus of claim 11, wherein thecomputer-executable instructions, when executed by the one or moreprocessors, further cause the apparatus to: determine a cumulativerunning average of spreads from a plurality of accepted trades by thefirst user; determine a spread from a most recent accepted trade by thefirst user; and select, as the first user spread, a lesser of: thecumulative running average of spreads; and the spread from the mostrecent accepted trade.
 15. The cryptography machine learning enabledblockchain based apparatus of claim 11, wherein the computer-executableinstructions, when executed by the one or more processors, further causethe apparatus to adjust the quote based on a comparison of the quotewith one or more quotes that were not accepted.
 16. The cryptographymachine learning enabled blockchain based apparatus of claim 11, whereinthe one or more coefficients comprises a first coefficient, a secondcoefficient, and a third coefficient, and wherein thecomputer-executable instructions, when executed by the one or moreprocessors, cause the apparatus to perform the summation by performing asummation of: the intercept constant; a product of the first coefficientand the indication of market conditions; a product of the secondcoefficient and the indication of liquidity; and a product of the thirdcoefficient and the first user spread.
 17. The cryptography machinelearning enabled blockchain based apparatus of claim 11, wherein thecomputer-executable instructions, when executed by the one or moreprocessors, cause the apparatus to: receive, from the first computingdevice, an indication that the quote is acceptable; determine, based onthe quote, a pricing agreement; and transmit, via the permissionedblockchain distributed ledger and to the plurality of blockchain nodes,a smart contract comprising the pricing agreement.
 18. The cryptographymachine learning enabled blockchain based apparatus of claim 11, whereinthe computer-executable instructions, when executed by the one or moreprocessors, cause the apparatus to perform, prior to the first time, oneor more of the determining the first user spread and the performing theregression analysis.